./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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_string_compare_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 66fb9bfec5c458b51d86deb6748dd65f162e7ac6a772af5f3fec59d101a18d8d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 03:22:44,825 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:22:44,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:22:44,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:22:44,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:22:44,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:22:44,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:22:44,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:22:44,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:22:44,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:22:44,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:22:44,889 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:22:44,889 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:22:44,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:22:44,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:22:44,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:22:44,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:22:44,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:22:44,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:22:44,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:22:44,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:22:44,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:22:44,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:22:44,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:22:44,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:22:44,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:22:44,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:22:44,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:22:44,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:22:44,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:22:44,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:22:44,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:22:44,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:22:44,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:22:44,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:22:44,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:22:44,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:22:44,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:22:44,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:22:44,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:22:44,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:22:44,935 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 03:22:44,962 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:22:44,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:22:44,963 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:22:44,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:22:44,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:22:44,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:22:44,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:22:44,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:22:44,966 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:22:44,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:22:44,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 03:22:44,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:22:44,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:22:44,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:22:44,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:22:44,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:22:44,968 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:22:44,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:22:44,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:22:44,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:22:44,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:22:44,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:22:44,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:22:44,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:22:44,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:22:44,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 03:22:44,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 03:22:44,970 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:22:44,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:22:44,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:22:44,971 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 -> 66fb9bfec5c458b51d86deb6748dd65f162e7ac6a772af5f3fec59d101a18d8d [2021-12-28 03:22:45,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:22:45,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:22:45,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:22:45,283 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:22:45,284 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:22:45,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i [2021-12-28 03:22:45,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9de06029/e47da510495341b89d7cbc918bab24d8/FLAGf66652e1f [2021-12-28 03:22:46,023 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:22:46,024 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_string_compare_harness.i [2021-12-28 03:22:46,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9de06029/e47da510495341b89d7cbc918bab24d8/FLAGf66652e1f [2021-12-28 03:22:46,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9de06029/e47da510495341b89d7cbc918bab24d8 [2021-12-28 03:22:46,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:22:46,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:22:46,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:22:46,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:22:46,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:22:46,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:22:46" (1/1) ... [2021-12-28 03:22:46,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59108209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:46, skipping insertion in model container [2021-12-28 03:22:46,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:22:46" (1/1) ... [2021-12-28 03:22:46,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:22:46,557 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:22:46,945 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_string_compare_harness.i[4492,4505] [2021-12-28 03:22:46,950 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_string_compare_harness.i[4552,4565] [2021-12-28 03:22:47,503 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:47,505 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:47,506 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:47,507 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:47,509 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:47,538 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:47,539 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:47,540 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:47,541 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:47,785 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:22:47,787 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:22:47,787 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:22:47,788 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:22:47,791 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:22:47,793 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:22:47,794 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:22:47,795 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:22:47,796 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:22:47,798 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:22:47,941 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:22:48,056 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,057 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:22:48,248 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:22:48,272 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_string_compare_harness.i[4492,4505] [2021-12-28 03:22:48,273 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_string_compare_harness.i[4552,4565] [2021-12-28 03:22:48,304 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,305 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,305 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,306 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,306 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,311 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,311 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,313 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,314 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,344 WARN L610 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-12-28 03:22:48,345 WARN L610 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-12-28 03:22:48,345 WARN L610 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-12-28 03:22:48,346 WARN L610 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-12-28 03:22:48,347 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-12-28 03:22:48,348 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-12-28 03:22:48,348 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-12-28 03:22:48,348 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-12-28 03:22:48,349 WARN L610 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-12-28 03:22:48,349 WARN L610 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2021-12-28 03:22:48,397 WARN L610 FunctionHandler]: implicit declaration of function __builtin_va_copy [2021-12-28 03:22:48,443 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,443 WARN L1533 CHandler]: Possible shadowing of function index [2021-12-28 03:22:48,489 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:22:48,711 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:22:48,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48 WrapperNode [2021-12-28 03:22:48,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:22:48,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:22:48,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:22:48,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:22:48,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:48,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:48,992 INFO L137 Inliner]: procedures = 693, calls = 2780, calls flagged for inlining = 57, calls inlined = 5, statements flattened = 822 [2021-12-28 03:22:48,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:22:48,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:22:48,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:22:48,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:22:49,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:49,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:49,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:49,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:49,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:49,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:49,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:49,138 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:22:49,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:22:49,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:22:49,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:22:49,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (1/1) ... [2021-12-28 03:22:49,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:22:49,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:22:49,183 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) [2021-12-28 03:22:49,188 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 [2021-12-28 03:22:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_is_valid [2021-12-28 03:22:49,220 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_is_valid [2021-12-28 03:22:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_compare [2021-12-28 03:22:49,220 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_compare [2021-12-28 03:22:49,220 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_string_is_allocated_bounded_length [2021-12-28 03:22:49,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_string_is_allocated_bounded_length [2021-12-28 03:22:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-28 03:22:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2021-12-28 03:22:49,221 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2021-12-28 03:22:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 03:22:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-28 03:22:49,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-28 03:22:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 03:22:49,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:22:49,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 03:22:49,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:22:49,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:22:49,222 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2021-12-28 03:22:49,222 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2021-12-28 03:22:49,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-28 03:22:49,222 INFO L130 BoogieDeclarations]: Found specification of procedure aws_string_bytes [2021-12-28 03:22:49,222 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_string_bytes [2021-12-28 03:22:49,222 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-28 03:22:49,223 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-28 03:22:49,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 03:22:49,223 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2021-12-28 03:22:49,223 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2021-12-28 03:22:49,223 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2021-12-28 03:22:49,223 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2021-12-28 03:22:49,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 03:22:49,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 03:22:49,453 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:22:49,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:22:50,177 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:22:50,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:22:50,182 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 03:22:50,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:22:50 BoogieIcfgContainer [2021-12-28 03:22:50,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:22:50,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:22:50,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:22:50,187 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:22:50,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:22:46" (1/3) ... [2021-12-28 03:22:50,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15496844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:22:50, skipping insertion in model container [2021-12-28 03:22:50,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:22:48" (2/3) ... [2021-12-28 03:22:50,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15496844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:22:50, skipping insertion in model container [2021-12-28 03:22:50,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:22:50" (3/3) ... [2021-12-28 03:22:50,189 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_string_compare_harness.i [2021-12-28 03:22:50,192 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:22:50,192 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:22:50,220 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:22:50,224 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 03:22:50,224 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 03:22:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 80 states have (on average 1.3) internal successors, (104), 81 states have internal predecessors, (104), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-28 03:22:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-28 03:22:50,241 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:50,242 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-12-28 03:22:50,242 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:50,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:50,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1023392938, now seen corresponding path program 1 times [2021-12-28 03:22:50,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:50,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794759249] [2021-12-28 03:22:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:50,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:50,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:50,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-28 03:22:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:50,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:22:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:50,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:22:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 03:22:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:50,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-28 03:22:50,758 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:50,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794759249] [2021-12-28 03:22:50,759 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794759249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:50,759 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:50,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 03:22:50,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000837131] [2021-12-28 03:22:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:50,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-28 03:22:50,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:50,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 03:22:50,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 03:22:50,793 INFO L87 Difference]: Start difference. First operand has 125 states, 80 states have (on average 1.3) internal successors, (104), 81 states have internal predecessors, (104), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 03:22:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:50,826 INFO L93 Difference]: Finished difference Result 245 states and 350 transitions. [2021-12-28 03:22:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 03:22:50,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2021-12-28 03:22:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:50,836 INFO L225 Difference]: With dead ends: 245 [2021-12-28 03:22:50,837 INFO L226 Difference]: Without dead ends: 120 [2021-12-28 03:22:50,841 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 03:22:50,843 INFO L933 BasicCegarLoop]: 168 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, 168 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 [2021-12-28 03:22:50,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:22:50,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-28 03:22:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2021-12-28 03:22:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 77 states have internal predecessors, (97), 33 states have call successors, (33), 10 states have call predecessors, (33), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-12-28 03:22:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 162 transitions. [2021-12-28 03:22:50,874 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 162 transitions. Word has length 52 [2021-12-28 03:22:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:50,875 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 162 transitions. [2021-12-28 03:22:50,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 03:22:50,875 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 162 transitions. [2021-12-28 03:22:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-12-28 03:22:50,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:50,877 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-12-28 03:22:50,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 03:22:50,878 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:50,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1611808362, now seen corresponding path program 1 times [2021-12-28 03:22:50,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:50,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350213581] [2021-12-28 03:22:50,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:50,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-28 03:22:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:22:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:22:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 03:22:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-28 03:22:51,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:51,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350213581] [2021-12-28 03:22:51,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350213581] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:51,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:51,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 03:22:51,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032050206] [2021-12-28 03:22:51,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:51,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:22:51,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:51,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:22:51,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 03:22:51,092 INFO L87 Difference]: Start difference. First operand 120 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 03:22:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:51,122 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2021-12-28 03:22:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 03:22:51,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2021-12-28 03:22:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:51,124 INFO L225 Difference]: With dead ends: 176 [2021-12-28 03:22:51,124 INFO L226 Difference]: Without dead ends: 140 [2021-12-28 03:22:51,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 03:22:51,126 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 8 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:51,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 477 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:22:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-28 03:22:51,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2021-12-28 03:22:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2021-12-28 03:22:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 188 transitions. [2021-12-28 03:22:51,137 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 188 transitions. Word has length 52 [2021-12-28 03:22:51,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:51,137 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 188 transitions. [2021-12-28 03:22:51,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-28 03:22:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 188 transitions. [2021-12-28 03:22:51,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-12-28 03:22:51,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:51,139 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-12-28 03:22:51,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 03:22:51,140 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1339119567, now seen corresponding path program 1 times [2021-12-28 03:22:51,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926157798] [2021-12-28 03:22:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:51,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:51,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-28 03:22:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:22:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:22:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 03:22:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:22:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,294 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-28 03:22:51,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:51,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926157798] [2021-12-28 03:22:51,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926157798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:51,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:51,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-28 03:22:51,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065840680] [2021-12-28 03:22:51,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:51,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-28 03:22:51,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:51,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-28 03:22:51,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 03:22:51,303 INFO L87 Difference]: Start difference. First operand 137 states and 188 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:22:51,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:51,332 INFO L93 Difference]: Finished difference Result 164 states and 222 transitions. [2021-12-28 03:22:51,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-28 03:22:51,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2021-12-28 03:22:51,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:51,334 INFO L225 Difference]: With dead ends: 164 [2021-12-28 03:22:51,334 INFO L226 Difference]: Without dead ends: 143 [2021-12-28 03:22:51,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-28 03:22:51,335 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:51,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:22:51,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-28 03:22:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-12-28 03:22:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 93 states have (on average 1.2688172043010753) internal successors, (118), 93 states have internal predecessors, (118), 38 states have call successors, (38), 10 states have call predecessors, (38), 11 states have return successors, (39), 39 states have call predecessors, (39), 37 states have call successors, (39) [2021-12-28 03:22:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 195 transitions. [2021-12-28 03:22:51,344 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 195 transitions. Word has length 61 [2021-12-28 03:22:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:51,344 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 195 transitions. [2021-12-28 03:22:51,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:22:51,345 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 195 transitions. [2021-12-28 03:22:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 03:22:51,346 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:51,346 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-12-28 03:22:51,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 03:22:51,347 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash 911301910, now seen corresponding path program 1 times [2021-12-28 03:22:51,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:51,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434644512] [2021-12-28 03:22:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:51,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-28 03:22:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:22:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:22:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 03:22:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:22:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-28 03:22:51,566 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:51,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434644512] [2021-12-28 03:22:51,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434644512] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:51,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:51,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:22:51,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264382693] [2021-12-28 03:22:51,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:51,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:22:51,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:51,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:22:51,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:22:51,568 INFO L87 Difference]: Start difference. First operand 143 states and 195 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-28 03:22:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:51,595 INFO L93 Difference]: Finished difference Result 207 states and 280 transitions. [2021-12-28 03:22:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:22:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 62 [2021-12-28 03:22:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:51,597 INFO L225 Difference]: With dead ends: 207 [2021-12-28 03:22:51,597 INFO L226 Difference]: Without dead ends: 163 [2021-12-28 03:22:51,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:22:51,598 INFO L933 BasicCegarLoop]: 166 mSDtfsCounter, 5 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:51,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 650 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:22:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-28 03:22:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-12-28 03:22:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 107 states have (on average 1.2616822429906542) internal successors, (135), 108 states have internal predecessors, (135), 44 states have call successors, (44), 10 states have call predecessors, (44), 11 states have return successors, (44), 44 states have call predecessors, (44), 41 states have call successors, (44) [2021-12-28 03:22:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 223 transitions. [2021-12-28 03:22:51,607 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 223 transitions. Word has length 62 [2021-12-28 03:22:51,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:51,607 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 223 transitions. [2021-12-28 03:22:51,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-28 03:22:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 223 transitions. [2021-12-28 03:22:51,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-28 03:22:51,609 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:51,610 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 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] [2021-12-28 03:22:51,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 03:22:51,610 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:51,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:51,610 INFO L85 PathProgramCache]: Analyzing trace with hash 17815572, now seen corresponding path program 1 times [2021-12-28 03:22:51,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:51,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983615762] [2021-12-28 03:22:51,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:51,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-28 03:22:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:22:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:22:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2021-12-28 03:22:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:22:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-12-28 03:22:51,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:51,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983615762] [2021-12-28 03:22:51,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983615762] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:22:51,787 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:22:51,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 03:22:51,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406843465] [2021-12-28 03:22:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:22:51,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 03:22:51,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:51,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 03:22:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 03:22:51,810 INFO L87 Difference]: Start difference. First operand 163 states and 223 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-28 03:22:51,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:51,885 INFO L93 Difference]: Finished difference Result 193 states and 260 transitions. [2021-12-28 03:22:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 03:22:51,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 62 [2021-12-28 03:22:51,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:51,887 INFO L225 Difference]: With dead ends: 193 [2021-12-28 03:22:51,887 INFO L226 Difference]: Without dead ends: 171 [2021-12-28 03:22:51,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:22:51,888 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 29 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:51,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 970 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:22:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-12-28 03:22:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 162. [2021-12-28 03:22:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 107 states have internal predecessors, (134), 44 states have call successors, (44), 10 states have call predecessors, (44), 11 states have return successors, (44), 44 states have call predecessors, (44), 41 states have call successors, (44) [2021-12-28 03:22:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 222 transitions. [2021-12-28 03:22:51,897 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 222 transitions. Word has length 62 [2021-12-28 03:22:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:51,897 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 222 transitions. [2021-12-28 03:22:51,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-28 03:22:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 222 transitions. [2021-12-28 03:22:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-28 03:22:51,899 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:51,900 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:51,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 03:22:51,900 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:22:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:22:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash -699694359, now seen corresponding path program 1 times [2021-12-28 03:22:51,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:22:51,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157728834] [2021-12-28 03:22:51,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:51,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:22:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-28 03:22:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:22:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:22:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:22:52,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 03:22:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:22:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:22:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 03:22:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-28 03:22:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:22:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:22:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 03:22:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-28 03:22:52,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:22:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157728834] [2021-12-28 03:22:52,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157728834] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:22:52,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916898268] [2021-12-28 03:22:52,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:22:52,326 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:22:52,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:22:52,327 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) [2021-12-28 03:22:52,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 03:22:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:22:52,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 2584 conjuncts, 79 conjunts are in the unsatisfiable core [2021-12-28 03:22:52,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:22:53,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 60 [2021-12-28 03:22:53,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:22:53,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:22:53,064 INFO L353 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2021-12-28 03:22:53,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 73 [2021-12-28 03:22:53,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-28 03:22:53,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2021-12-28 03:22:53,146 INFO L353 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-12-28 03:22:53,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 59 [2021-12-28 03:22:54,895 INFO L353 Elim1Store]: treesize reduction 93, result has 7.9 percent of original size [2021-12-28 03:22:54,896 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 196 treesize of output 121 [2021-12-28 03:22:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 03:22:55,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:22:56,465 INFO L387 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 52 treesize of output 48 [2021-12-28 03:22:56,497 INFO L353 Elim1Store]: treesize reduction 64, result has 36.6 percent of original size [2021-12-28 03:22:56,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 59 [2021-12-28 03:22:56,508 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 03:22:56,509 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2021-12-28 03:22:56,531 INFO L353 Elim1Store]: treesize reduction 66, result has 5.7 percent of original size [2021-12-28 03:22:56,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 50 [2021-12-28 03:22:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 03:22:56,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916898268] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:22:56,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:22:56,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 25, 18] total 50 [2021-12-28 03:22:56,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213101424] [2021-12-28 03:22:56,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:22:56,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2021-12-28 03:22:56,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:22:56,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2021-12-28 03:22:56,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2299, Unknown=0, NotChecked=0, Total=2450 [2021-12-28 03:22:56,914 INFO L87 Difference]: Start difference. First operand 162 states and 222 transitions. Second operand has 50 states, 44 states have (on average 2.840909090909091) internal successors, (125), 37 states have internal predecessors, (125), 17 states have call successors, (34), 7 states have call predecessors, (34), 12 states have return successors, (32), 20 states have call predecessors, (32), 15 states have call successors, (32) [2021-12-28 03:22:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:22:59,788 INFO L93 Difference]: Finished difference Result 249 states and 332 transitions. [2021-12-28 03:22:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-28 03:22:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 44 states have (on average 2.840909090909091) internal successors, (125), 37 states have internal predecessors, (125), 17 states have call successors, (34), 7 states have call predecessors, (34), 12 states have return successors, (32), 20 states have call predecessors, (32), 15 states have call successors, (32) Word has length 90 [2021-12-28 03:22:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:22:59,791 INFO L225 Difference]: With dead ends: 249 [2021-12-28 03:22:59,791 INFO L226 Difference]: Without dead ends: 68 [2021-12-28 03:22:59,793 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 161 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 970 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=308, Invalid=3982, Unknown=0, NotChecked=0, Total=4290 [2021-12-28 03:22:59,793 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 170 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-28 03:22:59,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 944 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2570 Invalid, 0 Unknown, 205 Unchecked, 1.8s Time] [2021-12-28 03:22:59,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-12-28 03:22:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2021-12-28 03:22:59,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-28 03:22:59,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2021-12-28 03:22:59,805 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 90 [2021-12-28 03:22:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:22:59,805 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2021-12-28 03:22:59,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 44 states have (on average 2.840909090909091) internal successors, (125), 37 states have internal predecessors, (125), 17 states have call successors, (34), 7 states have call predecessors, (34), 12 states have return successors, (32), 20 states have call predecessors, (32), 15 states have call successors, (32) [2021-12-28 03:22:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2021-12-28 03:22:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-28 03:22:59,810 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:22:59,810 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:22:59,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 03:23:00,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-28 03:23:00,031 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1244120169, now seen corresponding path program 1 times [2021-12-28 03:23:00,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:00,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020693157] [2021-12-28 03:23:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:00,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-28 03:23:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:23:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:23:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 03:23:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 03:23:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 03:23:00,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:23:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 03:23:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,284 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-28 03:23:00,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:00,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020693157] [2021-12-28 03:23:00,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020693157] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:23:00,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:23:00,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:23:00,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149313920] [2021-12-28 03:23:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:23:00,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:23:00,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:23:00,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:23:00,287 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:23:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:00,312 INFO L93 Difference]: Finished difference Result 113 states and 142 transitions. [2021-12-28 03:23:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:23:00,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2021-12-28 03:23:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:00,313 INFO L225 Difference]: With dead ends: 113 [2021-12-28 03:23:00,314 INFO L226 Difference]: Without dead ends: 65 [2021-12-28 03:23:00,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:23:00,314 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 13 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:00,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 320 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:23:00,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-12-28 03:23:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-12-28 03:23:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 43 states have internal predecessors, (49), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-28 03:23:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2021-12-28 03:23:00,319 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 96 [2021-12-28 03:23:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:00,319 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2021-12-28 03:23:00,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:23:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2021-12-28 03:23:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-28 03:23:00,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:23:00,320 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:00,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 03:23:00,321 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:23:00,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:23:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2083496473, now seen corresponding path program 1 times [2021-12-28 03:23:00,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:23:00,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839852422] [2021-12-28 03:23:00,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:23:00,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:23:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:23:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-12-28 03:23:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-28 03:23:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:23:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 03:23:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 03:23:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-28 03:23:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:23:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:23:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 03:23:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-28 03:23:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:23:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2021-12-28 03:23:00,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:23:00,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839852422] [2021-12-28 03:23:00,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839852422] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:23:00,636 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:23:00,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 03:23:00,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344107677] [2021-12-28 03:23:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:23:00,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:23:00,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:23:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:23:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:23:00,638 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 6 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-28 03:23:00,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:23:00,731 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2021-12-28 03:23:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 03:23:00,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 6 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 96 [2021-12-28 03:23:00,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:23:00,732 INFO L225 Difference]: With dead ends: 76 [2021-12-28 03:23:00,732 INFO L226 Difference]: Without dead ends: 0 [2021-12-28 03:23:00,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:23:00,733 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 20 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:23:00,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 337 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:23:00,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-28 03:23:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-28 03:23:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 03:23:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 03:23:00,734 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 96 [2021-12-28 03:23:00,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:23:00,734 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 03:23:00,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 6 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-28 03:23:00,734 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-28 03:23:00,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-28 03:23:00,736 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 03:23:00,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 03:23:00,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-28 03:23:01,002 INFO L854 garLoopResultBuilder]: At program point L6815(lines 6806 6816) the Hoare annotation is: (let ((.cse5 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (let ((.cse3 (select |#memory_int| |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.base|))) (let ((.cse2 (select .cse3 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 8)))) (let ((.cse1 (* (- 1) .cse2))) (let ((.cse0 (< (div (+ (- 1) .cse5 .cse1) (- 18446744073709551616)) (+ (div .cse2 18446744073709551616) 1))) (.cse4 (mod .cse2 18446744073709551616))) (or (and .cse0 (< (div (+ 18446744073709551615 .cse1) (- 18446744073709551616)) (+ (div (+ (- 9223372036854775808) .cse2) 18446744073709551616) 1)) (= (select .cse3 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| (- 18446744073709551600) .cse4)) 0)) (and (< 0 (+ (div (+ .cse5 (- 18446744073709551609)) 18446744073709551616) 1)) (= 0 .cse2)) (and .cse0 (<= .cse4 9223372036854775807) (= (select .cse3 (+ |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 16 .cse4)) 0))))))) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse5) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_#res#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse5))) [2021-12-28 03:23:01,003 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthEXIT(lines 6800 6804) no Hoare annotation was computed. [2021-12-28 03:23:01,003 INFO L854 garLoopResultBuilder]: At program point L6810(line 6810) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2021-12-28 03:23:01,003 INFO L858 garLoopResultBuilder]: For program point L6807-1(line 6807) no Hoare annotation was computed. [2021-12-28 03:23:01,003 INFO L854 garLoopResultBuilder]: At program point L6807(line 6807) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2021-12-28 03:23:01,003 INFO L858 garLoopResultBuilder]: For program point L6810-3(line 6810) no Hoare annotation was computed. [2021-12-28 03:23:01,003 INFO L854 garLoopResultBuilder]: At program point L6810-2(line 6810) the Hoare annotation is: (let ((.cse0 (mod |ensure_string_is_allocated_bounded_length_#in~max_size#1| 18446744073709551616))) (and (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~str~0#1.offset| 0) (< (mod |ensure_string_is_allocated_bounded_length_~len~1#1| 18446744073709551616) .cse0) (not (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| 16)) (< (mod |ensure_string_is_allocated_bounded_length_ensure_string_is_allocated_~len#1| 18446744073709551616) .cse0))) [2021-12-28 03:23:01,003 INFO L858 garLoopResultBuilder]: For program point L6810-1(lines 6810 6811) no Hoare annotation was computed. [2021-12-28 03:23:01,003 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:01,003 INFO L854 garLoopResultBuilder]: At program point ensure_string_is_allocated_bounded_lengthENTRY(lines 6800 6804) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:01,003 INFO L858 garLoopResultBuilder]: For program point L6810-5(lines 6810 6811) no Hoare annotation was computed. [2021-12-28 03:23:01,003 INFO L858 garLoopResultBuilder]: For program point L6801-1(line 6801) no Hoare annotation was computed. [2021-12-28 03:23:01,004 INFO L854 garLoopResultBuilder]: At program point L6801(line 6801) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |ensure_string_is_allocated_bounded_length_#in~max_size#1| |ensure_string_is_allocated_bounded_length_~max_size#1|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:01,004 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2021-12-28 03:23:01,004 INFO L858 garLoopResultBuilder]: For program point ensure_string_is_allocated_bounded_lengthFINAL(lines 6800 6804) no Hoare annotation was computed. [2021-12-28 03:23:01,004 INFO L854 garLoopResultBuilder]: At program point bounded_mallocENTRY(lines 6882 6887) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:01,004 INFO L858 garLoopResultBuilder]: For program point bounded_mallocFINAL(lines 6882 6887) no Hoare annotation was computed. [2021-12-28 03:23:01,004 INFO L858 garLoopResultBuilder]: For program point bounded_mallocEXIT(lines 6882 6887) no Hoare annotation was computed. [2021-12-28 03:23:01,004 INFO L858 garLoopResultBuilder]: For program point L6883-1(lines 6883 6885) no Hoare annotation was computed. [2021-12-28 03:23:01,004 INFO L854 garLoopResultBuilder]: At program point L6883(lines 6883 6885) the Hoare annotation is: (and (= |bounded_malloc_#in~size| bounded_malloc_~size) (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-12-28 03:23:01,004 INFO L858 garLoopResultBuilder]: For program point nondet_boolFINAL(line 261) no Hoare annotation was computed. [2021-12-28 03:23:01,004 INFO L858 garLoopResultBuilder]: For program point nondet_boolEXIT(line 261) no Hoare annotation was computed. [2021-12-28 03:23:01,004 INFO L861 garLoopResultBuilder]: At program point nondet_boolENTRY(line 261) the Hoare annotation is: true [2021-12-28 03:23:01,004 INFO L861 garLoopResultBuilder]: At program point aws_string_bytesENTRY(lines 6242 6246) the Hoare annotation is: true [2021-12-28 03:23:01,004 INFO L858 garLoopResultBuilder]: For program point aws_string_bytesEXIT(lines 6242 6246) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point aws_string_bytesFINAL(lines 6242 6246) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L861 garLoopResultBuilder]: At program point L6244-1(line 6244) the Hoare annotation is: true [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point L6244-2(line 6244) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L861 garLoopResultBuilder]: At program point L6244(line 6244) the Hoare annotation is: true [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorFINAL(lines 6889 6891) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point can_fail_allocatorEXIT(lines 6889 6891) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L861 garLoopResultBuilder]: At program point can_fail_allocatorENTRY(lines 6889 6891) the Hoare annotation is: true [2021-12-28 03:23:01,005 INFO L861 garLoopResultBuilder]: At program point aws_string_is_validENTRY(lines 6252 6257) the Hoare annotation is: true [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point L6256-2(line 6256) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point L6256(line 6256) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point L6256-5(line 6256) no Hoare annotation was computed. [2021-12-28 03:23:01,005 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validFINAL(lines 6252 6257) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point L6256-3(line 6256) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point aws_string_is_validEXIT(lines 6252 6257) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point L7100-1(lines 7099 7112) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L854 garLoopResultBuilder]: At program point L7100(line 7100) the Hoare annotation is: false [2021-12-28 03:23:01,006 INFO L854 garLoopResultBuilder]: At program point L9557(line 9557) the Hoare annotation is: false [2021-12-28 03:23:01,006 INFO L854 garLoopResultBuilder]: At program point L9557-1(line 9557) the Hoare annotation is: false [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point L9557-2(line 9557) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point L9549(lines 9549 9551) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point L9553-1(lines 9537 9559) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point L9537(lines 9537 9559) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-28 03:23:01,006 INFO L854 garLoopResultBuilder]: At program point L9554(line 9554) the Hoare annotation is: false [2021-12-28 03:23:01,007 INFO L854 garLoopResultBuilder]: At program point L9554-1(line 9554) the Hoare annotation is: false [2021-12-28 03:23:01,007 INFO L858 garLoopResultBuilder]: For program point L9554-2(line 9554) no Hoare annotation was computed. [2021-12-28 03:23:01,007 INFO L858 garLoopResultBuilder]: For program point L9542-1(lines 9542 9544) no Hoare annotation was computed. [2021-12-28 03:23:01,007 INFO L854 garLoopResultBuilder]: At program point L7110(line 7110) the Hoare annotation is: false [2021-12-28 03:23:01,007 INFO L854 garLoopResultBuilder]: At program point L9542-2(line 9542) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2021-12-28 03:23:01,007 INFO L858 garLoopResultBuilder]: For program point L9542-3(lines 9542 9543) no Hoare annotation was computed. [2021-12-28 03:23:01,007 INFO L861 garLoopResultBuilder]: At program point L9538(line 9538) the Hoare annotation is: true [2021-12-28 03:23:01,007 INFO L854 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: false [2021-12-28 03:23:01,007 INFO L854 garLoopResultBuilder]: At program point L9542(line 9542) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2021-12-28 03:23:01,007 INFO L858 garLoopResultBuilder]: For program point L7110-1(line 7110) no Hoare annotation was computed. [2021-12-28 03:23:01,007 INFO L858 garLoopResultBuilder]: For program point L9538-5(lines 9538 9539) no Hoare annotation was computed. [2021-12-28 03:23:01,007 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-28 03:23:01,007 INFO L858 garLoopResultBuilder]: For program point L7106-1(line 7106) no Hoare annotation was computed. [2021-12-28 03:23:01,007 INFO L858 garLoopResultBuilder]: For program point L9538-1(lines 9538 9539) no Hoare annotation was computed. [2021-12-28 03:23:01,008 INFO L858 garLoopResultBuilder]: For program point L9542-5(lines 9542 9543) no Hoare annotation was computed. [2021-12-28 03:23:01,008 INFO L861 garLoopResultBuilder]: At program point L9538-2(line 9538) the Hoare annotation is: true [2021-12-28 03:23:01,008 INFO L858 garLoopResultBuilder]: For program point L9538-3(line 9538) no Hoare annotation was computed. [2021-12-28 03:23:01,008 INFO L858 garLoopResultBuilder]: For program point L9542-7(lines 9542 9544) no Hoare annotation was computed. [2021-12-28 03:23:01,008 INFO L854 garLoopResultBuilder]: At program point L9547(line 9547) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.offset|) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2021-12-28 03:23:01,008 INFO L858 garLoopResultBuilder]: For program point L9547-1(line 9547) no Hoare annotation was computed. [2021-12-28 03:23:01,008 INFO L858 garLoopResultBuilder]: For program point L7107-1(lines 7107 7109) no Hoare annotation was computed. [2021-12-28 03:23:01,008 INFO L854 garLoopResultBuilder]: At program point L7107(lines 7107 7109) the Hoare annotation is: false [2021-12-28 03:23:01,008 INFO L858 garLoopResultBuilder]: For program point L7099(lines 7099 7112) no Hoare annotation was computed. [2021-12-28 03:23:01,008 INFO L861 garLoopResultBuilder]: At program point L9560(line 9560) the Hoare annotation is: true [2021-12-28 03:23:01,008 INFO L858 garLoopResultBuilder]: For program point L9548(line 9548) no Hoare annotation was computed. [2021-12-28 03:23:01,008 INFO L854 garLoopResultBuilder]: At program point L9548-2(line 9548) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| |ULTIMATE.start_aws_string_compare_harness_#t~ite1354#1.offset|) (= |ULTIMATE.start_aws_string_compare_harness_#t~ite1354#1.base| |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base|) (= |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| |ULTIMATE.start_aws_string_compare_harness_~str_b~1#1.offset|) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2021-12-28 03:23:01,008 INFO L858 garLoopResultBuilder]: For program point L9548-3(line 9548) no Hoare annotation was computed. [2021-12-28 03:23:01,008 INFO L854 garLoopResultBuilder]: At program point L9544(line 9544) the Hoare annotation is: (and (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.base| 0) (= |ULTIMATE.start_aws_string_compare_harness_~str_a~1#1.offset| 0)) [2021-12-28 03:23:01,008 INFO L858 garLoopResultBuilder]: For program point L9548-4(lines 9548 9552) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L858 garLoopResultBuilder]: For program point L9544-1(line 9544) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L858 garLoopResultBuilder]: For program point L9548-5(lines 9537 9559) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2021-12-28 03:23:01,009 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L861 garLoopResultBuilder]: At program point aws_string_compareENTRY(lines 9218 9252) the Hoare annotation is: true [2021-12-28 03:23:01,009 INFO L858 garLoopResultBuilder]: For program point L9239-2(line 9239) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L854 garLoopResultBuilder]: At program point L9239(line 9239) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2021-12-28 03:23:01,009 INFO L854 garLoopResultBuilder]: At program point L9239-1(line 9239) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2021-12-28 03:23:01,009 INFO L858 garLoopResultBuilder]: For program point L9219(line 9219) no Hoare annotation was computed. [2021-12-28 03:23:01,009 INFO L854 garLoopResultBuilder]: At program point L9219-2(line 9219) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base))) [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9219-3(line 9219) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9248(lines 9248 9250) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L854 garLoopResultBuilder]: At program point L9219-4(line 9219) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base))) [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9219-5(line 9219) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L854 garLoopResultBuilder]: At program point L9240(line 9240) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2021-12-28 03:23:01,010 INFO L854 garLoopResultBuilder]: At program point L9240-1(line 9240) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9240-2(line 9240) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9220(line 9220) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L854 garLoopResultBuilder]: At program point L9220-2(line 9220) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base))) [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9224(lines 9224 9228) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9245(lines 9245 9247) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9220-3(line 9220) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L854 garLoopResultBuilder]: At program point L9220-4(line 9220) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|)) (and (= aws_string_compare_~a.offset aws_string_compare_~b.offset) (= aws_string_compare_~a.base aws_string_compare_~b.base))) [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9220-5(line 9220) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9237(line 9237) no Hoare annotation was computed. [2021-12-28 03:23:01,010 INFO L858 garLoopResultBuilder]: For program point L9237-2(line 9237) no Hoare annotation was computed. [2021-12-28 03:23:01,011 INFO L854 garLoopResultBuilder]: At program point L9241(line 9241) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2021-12-28 03:23:01,011 INFO L854 garLoopResultBuilder]: At program point L9241-1(line 9241) the Hoare annotation is: (or (not (= |aws_string_compare_#in~a.base| |aws_string_compare_#in~b.base|)) (not (= |aws_string_compare_#in~b.offset| |aws_string_compare_#in~a.offset|))) [2021-12-28 03:23:01,011 INFO L858 garLoopResultBuilder]: For program point L9241-2(line 9241) no Hoare annotation was computed. [2021-12-28 03:23:01,011 INFO L858 garLoopResultBuilder]: For program point L9229(lines 9229 9233) no Hoare annotation was computed. [2021-12-28 03:23:01,011 INFO L858 garLoopResultBuilder]: For program point L9221(lines 9221 9223) no Hoare annotation was computed. [2021-12-28 03:23:01,011 INFO L858 garLoopResultBuilder]: For program point L9242(lines 9242 9244) no Hoare annotation was computed. [2021-12-28 03:23:01,011 INFO L858 garLoopResultBuilder]: For program point aws_string_compareEXIT(lines 9218 9252) no Hoare annotation was computed. [2021-12-28 03:23:01,011 INFO L858 garLoopResultBuilder]: For program point aws_string_compareFINAL(lines 9218 9252) no Hoare annotation was computed. [2021-12-28 03:23:01,014 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:23:01,017 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 03:23:01,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:23:01 BoogieIcfgContainer [2021-12-28 03:23:01,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 03:23:01,033 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 03:23:01,033 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 03:23:01,033 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 03:23:01,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:22:50" (3/4) ... [2021-12-28 03:23:01,036 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-28 03:23:01,042 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ensure_string_is_allocated_bounded_length [2021-12-28 03:23:01,042 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bounded_malloc [2021-12-28 03:23:01,042 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2021-12-28 03:23:01,042 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_bool [2021-12-28 03:23:01,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_bytes [2021-12-28 03:23:01,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2021-12-28 03:23:01,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2021-12-28 03:23:01,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_compare [2021-12-28 03:23:01,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure can_fail_allocator [2021-12-28 03:23:01,043 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_string_is_valid [2021-12-28 03:23:01,054 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2021-12-28 03:23:01,056 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2021-12-28 03:23:01,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2021-12-28 03:23:01,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-28 03:23:01,058 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-12-28 03:23:01,059 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-12-28 03:23:01,060 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-28 03:23:01,061 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-28 03:23:01,086 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\old(max_size) == max_size && (((((-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1 && (18446744073709551615 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < (-9223372036854775808 + unknown-#memory_int-unknown[\result][\result + 8]) / 18446744073709551616 + 1) && unknown-#memory_int-unknown[\result][\result + -18446744073709551600 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0) || (0 < (\old(max_size) % 18446744073709551616 + -18446744073709551609) / 18446744073709551616 + 1 && 0 == unknown-#memory_int-unknown[\result][\result + 8])) || (((-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1 && unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616 <= 9223372036854775807) && unknown-#memory_int-unknown[\result][\result + 16 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0))) && str == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && !(\old(max_size) == 16)) && \result == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616 [2021-12-28 03:23:01,666 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 03:23:01,666 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 03:23:01,667 INFO L158 Benchmark]: Toolchain (without parser) took 15282.55ms. Allocated memory was 62.9MB in the beginning and 471.9MB in the end (delta: 408.9MB). Free memory was 39.8MB in the beginning and 379.3MB in the end (delta: -339.5MB). Peak memory consumption was 331.5MB. Max. memory is 16.1GB. [2021-12-28 03:23:01,667 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 52.4MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 03:23:01,667 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2331.64ms. Allocated memory was 62.9MB in the beginning and 146.8MB in the end (delta: 83.9MB). Free memory was 39.6MB in the beginning and 73.5MB in the end (delta: -33.9MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. [2021-12-28 03:23:01,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 274.82ms. Allocated memory is still 146.8MB. Free memory was 73.5MB in the beginning and 62.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-28 03:23:01,668 INFO L158 Benchmark]: Boogie Preprocessor took 148.25ms. Allocated memory is still 146.8MB. Free memory was 62.2MB in the beginning and 92.6MB in the end (delta: -30.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2021-12-28 03:23:01,668 INFO L158 Benchmark]: RCFGBuilder took 1040.61ms. Allocated memory was 146.8MB in the beginning and 218.1MB in the end (delta: 71.3MB). Free memory was 92.6MB in the beginning and 128.1MB in the end (delta: -35.5MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2021-12-28 03:23:01,668 INFO L158 Benchmark]: TraceAbstraction took 10847.42ms. Allocated memory was 218.1MB in the beginning and 471.9MB in the end (delta: 253.8MB). Free memory was 128.1MB in the beginning and 367.2MB in the end (delta: -239.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-28 03:23:01,668 INFO L158 Benchmark]: Witness Printer took 633.88ms. Allocated memory is still 471.9MB. Free memory was 367.2MB in the beginning and 379.3MB in the end (delta: -12.1MB). Peak memory consumption was 249.1MB. Max. memory is 16.1GB. [2021-12-28 03:23:01,670 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 52.4MB. Free memory was 33.4MB in the beginning and 33.3MB in the end (delta: 24.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2331.64ms. Allocated memory was 62.9MB in the beginning and 146.8MB in the end (delta: 83.9MB). Free memory was 39.6MB in the beginning and 73.5MB in the end (delta: -33.9MB). Peak memory consumption was 57.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 274.82ms. Allocated memory is still 146.8MB. Free memory was 73.5MB in the beginning and 62.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.25ms. Allocated memory is still 146.8MB. Free memory was 62.2MB in the beginning and 92.6MB in the end (delta: -30.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1040.61ms. Allocated memory was 146.8MB in the beginning and 218.1MB in the end (delta: 71.3MB). Free memory was 92.6MB in the beginning and 128.1MB in the end (delta: -35.5MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10847.42ms. Allocated memory was 218.1MB in the beginning and 471.9MB in the end (delta: 253.8MB). Free memory was 128.1MB in the beginning and 367.2MB in the end (delta: -239.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 633.88ms. Allocated memory is still 471.9MB. Free memory was 367.2MB in the beginning and 379.3MB in the end (delta: -12.1MB). Peak memory consumption was 249.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 4337 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 205 IncrementalHoareTripleChecker+Unchecked, 3287 mSDsCounter, 132 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2766 IncrementalHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 132 mSolverCounterUnsat, 1050 mSDtfsCounter, 2766 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 306 SyntacticMatches, 5 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 983 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=4, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 247 PreInvPairs, 266 NumberOfFragments, 540 HoareAnnotationTreeSize, 247 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 45 FomulaSimplificationsInter, 71 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 661 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 741 ConstructedInterpolants, 28 QuantifiedInterpolants, 5701 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2584 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 344/374 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6806]: Loop Invariant Derived loop invariant: (((((\old(max_size) == max_size && (((((-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1 && (18446744073709551615 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < (-9223372036854775808 + unknown-#memory_int-unknown[\result][\result + 8]) / 18446744073709551616 + 1) && unknown-#memory_int-unknown[\result][\result + -18446744073709551600 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0) || (0 < (\old(max_size) % 18446744073709551616 + -18446744073709551609) / 18446744073709551616 + 1 && 0 == unknown-#memory_int-unknown[\result][\result + 8])) || (((-1 + \old(max_size) % 18446744073709551616 + -1 * unknown-#memory_int-unknown[\result][\result + 8]) / -18446744073709551616 < unknown-#memory_int-unknown[\result][\result + 8] / 18446744073709551616 + 1 && unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616 <= 9223372036854775807) && unknown-#memory_int-unknown[\result][\result + 16 + unknown-#memory_int-unknown[\result][\result + 8] % 18446744073709551616] == 0))) && str == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616) && !(\old(max_size) == 16)) && \result == 0) && len % 18446744073709551616 < \old(max_size) % 18446744073709551616 - InvariantResult [Line: 9560]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-28 03:23:01,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE