./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/unreach-call.prp --file /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 87fd6ee1 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 /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2555a6c6e6d3f77d5d21b6f07a8080dab24cab6c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-87fd6ee [2020-12-04 18:20:43,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-04 18:20:43,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-04 18:20:43,967 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-04 18:20:43,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-04 18:20:43,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-04 18:20:43,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-04 18:20:43,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-04 18:20:43,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-04 18:20:43,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-04 18:20:43,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-04 18:20:43,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-04 18:20:43,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-04 18:20:43,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-04 18:20:43,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-04 18:20:43,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-04 18:20:43,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-04 18:20:44,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-04 18:20:44,006 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-04 18:20:44,009 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-04 18:20:44,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-04 18:20:44,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-04 18:20:44,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-04 18:20:44,022 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-04 18:20:44,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-04 18:20:44,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-04 18:20:44,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-04 18:20:44,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-04 18:20:44,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-04 18:20:44,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-04 18:20:44,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-04 18:20:44,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-04 18:20:44,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-04 18:20:44,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-04 18:20:44,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-04 18:20:44,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-04 18:20:44,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-04 18:20:44,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-04 18:20:44,048 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-04 18:20:44,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-04 18:20:44,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-04 18:20:44,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-04 18:20:44,128 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-04 18:20:44,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-04 18:20:44,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-04 18:20:44,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-04 18:20:44,137 INFO L138 SettingsManager]: * Use SBE=true [2020-12-04 18:20:44,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-04 18:20:44,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-04 18:20:44,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-04 18:20:44,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-04 18:20:44,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-04 18:20:44,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-04 18:20:44,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-04 18:20:44,141 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-04 18:20:44,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-04 18:20:44,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-04 18:20:44,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-04 18:20:44,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-04 18:20:44,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 18:20:44,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-04 18:20:44,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-04 18:20:44,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-04 18:20:44,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-04 18:20:44,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-04 18:20:44,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-04 18:20:44,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-04 18:20:44,144 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 -> 2555a6c6e6d3f77d5d21b6f07a8080dab24cab6c [2020-12-04 18:20:44,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-04 18:20:44,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-04 18:20:44,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-04 18:20:44,796 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-04 18:20:44,797 INFO L275 PluginConnector]: CDTParser initialized [2020-12-04 18:20:44,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i [2020-12-04 18:20:44,922 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3446fc31e/8cb96088b72746b1997f83ff75f31be4/FLAGce827e2be [2020-12-04 18:20:46,337 INFO L306 CDTParser]: Found 1 translation units. [2020-12-04 18:20:46,338 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i [2020-12-04 18:20:46,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3446fc31e/8cb96088b72746b1997f83ff75f31be4/FLAGce827e2be [2020-12-04 18:20:46,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3446fc31e/8cb96088b72746b1997f83ff75f31be4 [2020-12-04 18:20:46,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-04 18:20:46,603 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-04 18:20:46,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-04 18:20:46,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-04 18:20:46,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-04 18:20:46,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:20:46" (1/1) ... [2020-12-04 18:20:46,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e9ebbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:46, skipping insertion in model container [2020-12-04 18:20:46,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.12 06:20:46" (1/1) ... [2020-12-04 18:20:46,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-04 18:20:46,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-04 18:20:47,140 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2020-12-04 18:20:47,151 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2020-12-04 18:20:47,185 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:20:47,199 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:20:48,267 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:48,268 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:48,269 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:48,271 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:48,273 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:48,305 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:48,307 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:48,310 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:48,310 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:48,748 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:20:48,749 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:20:48,751 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:20:48,752 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:20:48,754 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:20:48,754 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:20:48,755 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:20:48,756 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:20:48,757 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:20:48,757 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:20:48,919 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:20:49,067 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,068 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:20:49,224 INFO L203 MainTranslator]: Completed pre-run [2020-12-04 18:20:49,273 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i[4491,4504] [2020-12-04 18:20:49,275 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_byte_buf_init_harness.i[4551,4564] [2020-12-04 18:20:49,278 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2020-12-04 18:20:49,280 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2020-12-04 18:20:49,348 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,349 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,350 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,353 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,356 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,367 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,368 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,369 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,371 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,463 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2020-12-04 18:20:49,464 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2020-12-04 18:20:49,464 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2020-12-04 18:20:49,465 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2020-12-04 18:20:49,466 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2020-12-04 18:20:49,467 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2020-12-04 18:20:49,467 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2020-12-04 18:20:49,468 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2020-12-04 18:20:49,468 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2020-12-04 18:20:49,469 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2020-12-04 18:20:49,493 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2020-12-04 18:20:49,571 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,572 WARN L1501 CHandler]: Possible shadowing of function index [2020-12-04 18:20:49,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-04 18:20:51,074 INFO L208 MainTranslator]: Completed translation [2020-12-04 18:20:51,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51 WrapperNode [2020-12-04 18:20:51,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-04 18:20:51,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-04 18:20:51,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-04 18:20:51,077 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-04 18:20:51,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... [2020-12-04 18:20:51,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... [2020-12-04 18:20:51,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-04 18:20:51,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-04 18:20:51,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-04 18:20:51,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-04 18:20:51,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... [2020-12-04 18:20:51,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... [2020-12-04 18:20:51,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... [2020-12-04 18:20:51,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... [2020-12-04 18:20:51,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... [2020-12-04 18:20:51,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... [2020-12-04 18:20:51,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... [2020-12-04 18:20:51,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-04 18:20:51,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-04 18:20:51,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-04 18:20:51,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-04 18:20:51,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-04 18:20:51,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-04 18:20:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-04 18:20:51,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-04 18:20:51,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-04 18:20:51,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-04 18:20:51,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-04 18:20:51,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-04 18:20:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-04 18:20:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-12-04 18:20:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-04 18:20:51,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-04 18:21:04,343 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-04 18:21:04,344 INFO L299 CfgBuilder]: Removed 50 assume(true) statements. [2020-12-04 18:21:04,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:21:04 BoogieIcfgContainer [2020-12-04 18:21:04,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-04 18:21:04,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-04 18:21:04,349 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-04 18:21:04,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-04 18:21:04,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.12 06:20:46" (1/3) ... [2020-12-04 18:21:04,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45722455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:21:04, skipping insertion in model container [2020-12-04 18:21:04,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.12 06:20:51" (2/3) ... [2020-12-04 18:21:04,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45722455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 06:21:04, skipping insertion in model container [2020-12-04 18:21:04,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:21:04" (3/3) ... [2020-12-04 18:21:04,363 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_init_harness.i [2020-12-04 18:21:04,397 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-04 18:21:04,405 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-04 18:21:04,422 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-04 18:21:04,465 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-04 18:21:04,465 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-04 18:21:04,465 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-04 18:21:04,465 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-04 18:21:04,465 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-04 18:21:04,466 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-04 18:21:04,466 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-04 18:21:04,466 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-04 18:21:04,499 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states. [2020-12-04 18:21:04,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-04 18:21:04,511 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:04,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:04,514 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1714787328, now seen corresponding path program 1 times [2020-12-04 18:21:04,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:04,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985351663] [2020-12-04 18:21:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:05,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985351663] [2020-12-04 18:21:05,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:05,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-04 18:21:05,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167662732] [2020-12-04 18:21:05,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-04 18:21:05,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:06,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-04 18:21:06,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 18:21:06,020 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 2 states. [2020-12-04 18:21:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:06,072 INFO L93 Difference]: Finished difference Result 166 states and 223 transitions. [2020-12-04 18:21:06,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-04 18:21:06,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-12-04 18:21:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:06,099 INFO L225 Difference]: With dead ends: 166 [2020-12-04 18:21:06,102 INFO L226 Difference]: Without dead ends: 79 [2020-12-04 18:21:06,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-04 18:21:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-04 18:21:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-04 18:21:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-04 18:21:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2020-12-04 18:21:06,173 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 15 [2020-12-04 18:21:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:06,174 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2020-12-04 18:21:06,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-04 18:21:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2020-12-04 18:21:06,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-04 18:21:06,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:06,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:06,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-04 18:21:06,178 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:06,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:06,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1972952766, now seen corresponding path program 1 times [2020-12-04 18:21:06,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:06,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363950026] [2020-12-04 18:21:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:06,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:06,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363950026] [2020-12-04 18:21:06,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:06,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 18:21:06,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565689784] [2020-12-04 18:21:06,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 18:21:06,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:06,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 18:21:06,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:21:06,852 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 5 states. [2020-12-04 18:21:07,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:07,082 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2020-12-04 18:21:07,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:21:07,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-12-04 18:21:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:07,086 INFO L225 Difference]: With dead ends: 117 [2020-12-04 18:21:07,087 INFO L226 Difference]: Without dead ends: 79 [2020-12-04 18:21:07,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:21:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-04 18:21:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-04 18:21:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-04 18:21:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 95 transitions. [2020-12-04 18:21:07,103 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 95 transitions. Word has length 15 [2020-12-04 18:21:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:07,104 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 95 transitions. [2020-12-04 18:21:07,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 18:21:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2020-12-04 18:21:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-04 18:21:07,106 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:07,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:07,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-04 18:21:07,108 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1369831661, now seen corresponding path program 1 times [2020-12-04 18:21:07,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:07,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160840374] [2020-12-04 18:21:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:07,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:08,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:08,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160840374] [2020-12-04 18:21:08,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:08,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 18:21:08,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557541893] [2020-12-04 18:21:08,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 18:21:08,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:08,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 18:21:08,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:21:08,379 INFO L87 Difference]: Start difference. First operand 79 states and 95 transitions. Second operand 6 states. [2020-12-04 18:21:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:08,996 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2020-12-04 18:21:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:21:08,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-12-04 18:21:09,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:09,001 INFO L225 Difference]: With dead ends: 124 [2020-12-04 18:21:09,002 INFO L226 Difference]: Without dead ends: 120 [2020-12-04 18:21:09,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:21:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-12-04 18:21:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2020-12-04 18:21:09,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-12-04 18:21:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2020-12-04 18:21:09,023 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 21 [2020-12-04 18:21:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:09,024 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2020-12-04 18:21:09,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 18:21:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2020-12-04 18:21:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-04 18:21:09,026 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:09,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:09,027 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-04 18:21:09,027 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:09,029 INFO L82 PathProgramCache]: Analyzing trace with hash -692640299, now seen corresponding path program 1 times [2020-12-04 18:21:09,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:09,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736398386] [2020-12-04 18:21:09,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:09,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736398386] [2020-12-04 18:21:09,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:09,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-04 18:21:09,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337220837] [2020-12-04 18:21:09,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-04 18:21:09,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:09,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-04 18:21:09,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-04 18:21:09,539 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand 3 states. [2020-12-04 18:21:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:09,603 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2020-12-04 18:21:09,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-04 18:21:09,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-12-04 18:21:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:09,610 INFO L225 Difference]: With dead ends: 124 [2020-12-04 18:21:09,611 INFO L226 Difference]: Without dead ends: 88 [2020-12-04 18:21:09,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-04 18:21:09,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-12-04 18:21:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-12-04 18:21:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-12-04 18:21:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2020-12-04 18:21:09,658 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 25 [2020-12-04 18:21:09,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:09,660 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2020-12-04 18:21:09,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-04 18:21:09,660 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2020-12-04 18:21:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-04 18:21:09,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:09,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:09,667 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-04 18:21:09,669 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:09,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:09,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1893417011, now seen corresponding path program 1 times [2020-12-04 18:21:09,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:09,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425973046] [2020-12-04 18:21:09,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:16,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:16,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425973046] [2020-12-04 18:21:16,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:16,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:21:16,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984440247] [2020-12-04 18:21:16,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:21:16,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:16,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:21:16,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:21:16,504 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand 9 states. [2020-12-04 18:21:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:20,030 INFO L93 Difference]: Finished difference Result 206 states and 244 transitions. [2020-12-04 18:21:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-04 18:21:20,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-12-04 18:21:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:20,041 INFO L225 Difference]: With dead ends: 206 [2020-12-04 18:21:20,041 INFO L226 Difference]: Without dead ends: 157 [2020-12-04 18:21:20,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2020-12-04 18:21:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-04 18:21:20,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 98. [2020-12-04 18:21:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-12-04 18:21:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2020-12-04 18:21:20,070 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 25 [2020-12-04 18:21:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:20,073 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2020-12-04 18:21:20,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:21:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2020-12-04 18:21:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-04 18:21:20,078 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:20,080 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:20,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-04 18:21:20,083 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:20,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1635251573, now seen corresponding path program 1 times [2020-12-04 18:21:20,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:20,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784806854] [2020-12-04 18:21:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:20,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784806854] [2020-12-04 18:21:20,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:20,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 18:21:20,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045953096] [2020-12-04 18:21:20,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 18:21:20,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:20,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 18:21:20,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:21:20,811 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand 5 states. [2020-12-04 18:21:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:23,152 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2020-12-04 18:21:23,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:21:23,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-04 18:21:23,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:23,154 INFO L225 Difference]: With dead ends: 173 [2020-12-04 18:21:23,154 INFO L226 Difference]: Without dead ends: 118 [2020-12-04 18:21:23,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:21:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-12-04 18:21:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2020-12-04 18:21:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-12-04 18:21:23,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2020-12-04 18:21:23,163 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 25 [2020-12-04 18:21:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:23,163 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 122 transitions. [2020-12-04 18:21:23,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 18:21:23,163 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions. [2020-12-04 18:21:23,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-04 18:21:23,164 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:23,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:23,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-04 18:21:23,165 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:23,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:23,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1648598473, now seen corresponding path program 1 times [2020-12-04 18:21:23,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:23,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427907273] [2020-12-04 18:21:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:23,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:23,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427907273] [2020-12-04 18:21:23,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:23,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 18:21:23,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13962510] [2020-12-04 18:21:23,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 18:21:23,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:23,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 18:21:23,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:21:23,690 INFO L87 Difference]: Start difference. First operand 102 states and 122 transitions. Second operand 5 states. [2020-12-04 18:21:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:26,036 INFO L93 Difference]: Finished difference Result 205 states and 240 transitions. [2020-12-04 18:21:26,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:21:26,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-04 18:21:26,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:26,039 INFO L225 Difference]: With dead ends: 205 [2020-12-04 18:21:26,039 INFO L226 Difference]: Without dead ends: 157 [2020-12-04 18:21:26,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:21:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-12-04 18:21:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 110. [2020-12-04 18:21:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-04 18:21:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 133 transitions. [2020-12-04 18:21:26,049 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 133 transitions. Word has length 25 [2020-12-04 18:21:26,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:26,049 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 133 transitions. [2020-12-04 18:21:26,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 18:21:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 133 transitions. [2020-12-04 18:21:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-04 18:21:26,050 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:26,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:26,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-04 18:21:26,051 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:26,052 INFO L82 PathProgramCache]: Analyzing trace with hash 968540103, now seen corresponding path program 1 times [2020-12-04 18:21:26,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:26,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106166680] [2020-12-04 18:21:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:26,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106166680] [2020-12-04 18:21:26,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:26,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 18:21:26,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034151660] [2020-12-04 18:21:26,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 18:21:26,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:26,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 18:21:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:21:26,534 INFO L87 Difference]: Start difference. First operand 110 states and 133 transitions. Second operand 5 states. [2020-12-04 18:21:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:28,857 INFO L93 Difference]: Finished difference Result 168 states and 200 transitions. [2020-12-04 18:21:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:21:28,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2020-12-04 18:21:28,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:28,861 INFO L225 Difference]: With dead ends: 168 [2020-12-04 18:21:28,861 INFO L226 Difference]: Without dead ends: 119 [2020-12-04 18:21:28,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:21:28,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-12-04 18:21:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112. [2020-12-04 18:21:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-04 18:21:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2020-12-04 18:21:28,868 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 25 [2020-12-04 18:21:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:28,868 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2020-12-04 18:21:28,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 18:21:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2020-12-04 18:21:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-04 18:21:28,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:28,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:28,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-04 18:21:28,870 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:28,871 INFO L82 PathProgramCache]: Analyzing trace with hash 895707603, now seen corresponding path program 1 times [2020-12-04 18:21:28,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:28,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668275241] [2020-12-04 18:21:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:29,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668275241] [2020-12-04 18:21:29,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:29,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:21:29,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276071731] [2020-12-04 18:21:29,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:21:29,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:29,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:21:29,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:21:29,125 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand 4 states. [2020-12-04 18:21:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:29,162 INFO L93 Difference]: Finished difference Result 153 states and 183 transitions. [2020-12-04 18:21:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 18:21:29,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-12-04 18:21:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:29,164 INFO L225 Difference]: With dead ends: 153 [2020-12-04 18:21:29,164 INFO L226 Difference]: Without dead ends: 112 [2020-12-04 18:21:29,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:21:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-04 18:21:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2020-12-04 18:21:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-12-04 18:21:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2020-12-04 18:21:29,176 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 25 [2020-12-04 18:21:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:29,176 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2020-12-04 18:21:29,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:21:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2020-12-04 18:21:29,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-04 18:21:29,177 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:29,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:29,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-04 18:21:29,178 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:29,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:29,179 INFO L82 PathProgramCache]: Analyzing trace with hash -123775902, now seen corresponding path program 1 times [2020-12-04 18:21:29,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:29,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241768065] [2020-12-04 18:21:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:29,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:29,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241768065] [2020-12-04 18:21:29,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:29,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:21:29,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226890606] [2020-12-04 18:21:29,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:21:29,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:21:29,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:21:29,658 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 8 states. [2020-12-04 18:21:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:30,189 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2020-12-04 18:21:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-04 18:21:30,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-12-04 18:21:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:30,192 INFO L225 Difference]: With dead ends: 169 [2020-12-04 18:21:30,192 INFO L226 Difference]: Without dead ends: 165 [2020-12-04 18:21:30,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:21:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-12-04 18:21:30,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 114. [2020-12-04 18:21:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-12-04 18:21:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2020-12-04 18:21:30,200 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 27 [2020-12-04 18:21:30,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:30,200 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2020-12-04 18:21:30,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:21:30,201 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2020-12-04 18:21:30,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-04 18:21:30,201 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:30,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:30,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-04 18:21:30,202 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:30,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:30,203 INFO L82 PathProgramCache]: Analyzing trace with hash -933122528, now seen corresponding path program 1 times [2020-12-04 18:21:30,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:30,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635412689] [2020-12-04 18:21:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:30,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:30,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635412689] [2020-12-04 18:21:30,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:30,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:21:30,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5207388] [2020-12-04 18:21:30,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:21:30,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:21:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:21:30,631 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 4 states. [2020-12-04 18:21:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:32,896 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2020-12-04 18:21:32,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:21:32,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-12-04 18:21:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:32,898 INFO L225 Difference]: With dead ends: 169 [2020-12-04 18:21:32,898 INFO L226 Difference]: Without dead ends: 117 [2020-12-04 18:21:32,899 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:21:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-12-04 18:21:32,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2020-12-04 18:21:32,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-12-04 18:21:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2020-12-04 18:21:32,905 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 27 [2020-12-04 18:21:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:32,906 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2020-12-04 18:21:32,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:21:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2020-12-04 18:21:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-12-04 18:21:32,907 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:32,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:32,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-04 18:21:32,907 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:32,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:32,908 INFO L82 PathProgramCache]: Analyzing trace with hash 192748585, now seen corresponding path program 1 times [2020-12-04 18:21:32,908 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:32,908 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322597883] [2020-12-04 18:21:32,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:38,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322597883] [2020-12-04 18:21:38,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:38,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-04 18:21:38,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112030423] [2020-12-04 18:21:38,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-04 18:21:38,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:38,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-04 18:21:38,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:21:38,074 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand 6 states. [2020-12-04 18:21:38,444 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2020-12-04 18:21:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:38,496 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2020-12-04 18:21:38,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 18:21:38,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-12-04 18:21:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:38,501 INFO L225 Difference]: With dead ends: 113 [2020-12-04 18:21:38,502 INFO L226 Difference]: Without dead ends: 111 [2020-12-04 18:21:38,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:21:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-12-04 18:21:38,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-12-04 18:21:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-12-04 18:21:38,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2020-12-04 18:21:38,513 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 36 [2020-12-04 18:21:38,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:38,514 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2020-12-04 18:21:38,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-04 18:21:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2020-12-04 18:21:38,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-04 18:21:38,515 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:38,516 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:38,516 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-04 18:21:38,516 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:38,517 INFO L82 PathProgramCache]: Analyzing trace with hash 547927563, now seen corresponding path program 1 times [2020-12-04 18:21:38,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:38,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55085663] [2020-12-04 18:21:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:39,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55085663] [2020-12-04 18:21:39,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:39,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:21:39,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811107839] [2020-12-04 18:21:39,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:21:39,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:39,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:21:39,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:21:39,528 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand 7 states. [2020-12-04 18:21:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:42,222 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2020-12-04 18:21:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:21:42,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-12-04 18:21:42,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:42,224 INFO L225 Difference]: With dead ends: 144 [2020-12-04 18:21:42,225 INFO L226 Difference]: Without dead ends: 142 [2020-12-04 18:21:42,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:21:42,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-04 18:21:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 136. [2020-12-04 18:21:42,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-12-04 18:21:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 162 transitions. [2020-12-04 18:21:42,234 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 162 transitions. Word has length 38 [2020-12-04 18:21:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:42,235 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 162 transitions. [2020-12-04 18:21:42,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:21:42,235 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 162 transitions. [2020-12-04 18:21:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-04 18:21:42,235 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:42,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:42,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-04 18:21:42,236 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:42,237 INFO L82 PathProgramCache]: Analyzing trace with hash 718836703, now seen corresponding path program 1 times [2020-12-04 18:21:42,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:42,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88708066] [2020-12-04 18:21:42,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:42,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:42,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88708066] [2020-12-04 18:21:42,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:42,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 18:21:42,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456722990] [2020-12-04 18:21:42,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 18:21:42,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:42,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 18:21:42,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:21:42,713 INFO L87 Difference]: Start difference. First operand 136 states and 162 transitions. Second operand 5 states. [2020-12-04 18:21:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:45,095 INFO L93 Difference]: Finished difference Result 276 states and 319 transitions. [2020-12-04 18:21:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:21:45,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-12-04 18:21:45,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:45,098 INFO L225 Difference]: With dead ends: 276 [2020-12-04 18:21:45,098 INFO L226 Difference]: Without dead ends: 200 [2020-12-04 18:21:45,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:21:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-12-04 18:21:45,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2020-12-04 18:21:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-12-04 18:21:45,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2020-12-04 18:21:45,109 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 38 [2020-12-04 18:21:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:45,109 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2020-12-04 18:21:45,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 18:21:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2020-12-04 18:21:45,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-04 18:21:45,110 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:45,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:45,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-04 18:21:45,110 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:45,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:45,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1398895073, now seen corresponding path program 1 times [2020-12-04 18:21:45,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:45,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344521520] [2020-12-04 18:21:45,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:49,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344521520] [2020-12-04 18:21:49,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:49,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 18:21:49,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947760335] [2020-12-04 18:21:49,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 18:21:49,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:49,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 18:21:49,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:21:49,273 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand 11 states. [2020-12-04 18:21:56,399 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2020-12-04 18:21:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:56,622 INFO L93 Difference]: Finished difference Result 225 states and 257 transitions. [2020-12-04 18:21:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-04 18:21:56,624 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2020-12-04 18:21:56,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:56,626 INFO L225 Difference]: With dead ends: 225 [2020-12-04 18:21:56,626 INFO L226 Difference]: Without dead ends: 198 [2020-12-04 18:21:56,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:21:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-12-04 18:21:56,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2020-12-04 18:21:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-12-04 18:21:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2020-12-04 18:21:56,639 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 38 [2020-12-04 18:21:56,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:56,639 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2020-12-04 18:21:56,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 18:21:56,640 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2020-12-04 18:21:56,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-04 18:21:56,640 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:56,641 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:56,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-04 18:21:56,641 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:56,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:56,642 INFO L82 PathProgramCache]: Analyzing trace with hash 806093001, now seen corresponding path program 1 times [2020-12-04 18:21:56,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:56,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796039537] [2020-12-04 18:21:56,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:56,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:21:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:21:56,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796039537] [2020-12-04 18:21:56,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:21:56,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:21:56,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705551578] [2020-12-04 18:21:56,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:21:56,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:21:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:21:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:21:56,908 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand 4 states. [2020-12-04 18:21:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:21:57,047 INFO L93 Difference]: Finished difference Result 217 states and 250 transitions. [2020-12-04 18:21:57,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-04 18:21:57,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-12-04 18:21:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:21:57,051 INFO L225 Difference]: With dead ends: 217 [2020-12-04 18:21:57,052 INFO L226 Difference]: Without dead ends: 161 [2020-12-04 18:21:57,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:21:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-04 18:21:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2020-12-04 18:21:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-12-04 18:21:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 177 transitions. [2020-12-04 18:21:57,065 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 177 transitions. Word has length 38 [2020-12-04 18:21:57,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:21:57,066 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 177 transitions. [2020-12-04 18:21:57,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:21:57,066 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 177 transitions. [2020-12-04 18:21:57,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-04 18:21:57,067 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:21:57,067 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:21:57,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-04 18:21:57,068 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:21:57,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:21:57,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1657060511, now seen corresponding path program 1 times [2020-12-04 18:21:57,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:21:57,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785715102] [2020-12-04 18:21:57,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:21:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:00,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:00,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785715102] [2020-12-04 18:22:00,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:00,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:22:00,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168574035] [2020-12-04 18:22:00,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:22:00,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:00,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:22:00,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:22:00,006 INFO L87 Difference]: Start difference. First operand 153 states and 177 transitions. Second operand 9 states. [2020-12-04 18:22:02,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:02,548 INFO L93 Difference]: Finished difference Result 202 states and 229 transitions. [2020-12-04 18:22:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:22:02,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-12-04 18:22:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:02,552 INFO L225 Difference]: With dead ends: 202 [2020-12-04 18:22:02,552 INFO L226 Difference]: Without dead ends: 172 [2020-12-04 18:22:02,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-04 18:22:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-04 18:22:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2020-12-04 18:22:02,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-12-04 18:22:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2020-12-04 18:22:02,563 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 38 [2020-12-04 18:22:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:02,565 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2020-12-04 18:22:02,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:22:02,565 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2020-12-04 18:22:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-04 18:22:02,566 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:02,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:02,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-04 18:22:02,566 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash -34115109, now seen corresponding path program 1 times [2020-12-04 18:22:02,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:02,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518811446] [2020-12-04 18:22:02,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:22:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:07,937 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2020-12-04 18:22:08,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:08,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518811446] [2020-12-04 18:22:08,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:08,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:22:08,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916493609] [2020-12-04 18:22:08,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:22:08,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:08,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:22:08,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:22:08,085 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand 9 states. [2020-12-04 18:22:10,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:10,830 INFO L93 Difference]: Finished difference Result 268 states and 300 transitions. [2020-12-04 18:22:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:22:10,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2020-12-04 18:22:10,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:10,833 INFO L225 Difference]: With dead ends: 268 [2020-12-04 18:22:10,834 INFO L226 Difference]: Without dead ends: 173 [2020-12-04 18:22:10,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:22:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-12-04 18:22:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2020-12-04 18:22:10,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-04 18:22:10,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2020-12-04 18:22:10,847 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 38 [2020-12-04 18:22:10,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:10,847 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2020-12-04 18:22:10,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:22:10,848 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2020-12-04 18:22:10,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-04 18:22:10,848 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:10,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:10,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-04 18:22:10,849 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:10,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:10,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1490309383, now seen corresponding path program 1 times [2020-12-04 18:22:10,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:10,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718494063] [2020-12-04 18:22:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:22:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:11,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718494063] [2020-12-04 18:22:11,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:11,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-04 18:22:11,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351243460] [2020-12-04 18:22:11,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-04 18:22:11,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:11,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-04 18:22:11,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:22:11,205 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand 5 states. [2020-12-04 18:22:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:11,345 INFO L93 Difference]: Finished difference Result 510 states and 579 transitions. [2020-12-04 18:22:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 18:22:11,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-12-04 18:22:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:11,350 INFO L225 Difference]: With dead ends: 510 [2020-12-04 18:22:11,351 INFO L226 Difference]: Without dead ends: 394 [2020-12-04 18:22:11,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-04 18:22:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-12-04 18:22:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 160. [2020-12-04 18:22:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-12-04 18:22:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 180 transitions. [2020-12-04 18:22:11,367 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 180 transitions. Word has length 38 [2020-12-04 18:22:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:11,368 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 180 transitions. [2020-12-04 18:22:11,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-04 18:22:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 180 transitions. [2020-12-04 18:22:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-04 18:22:11,369 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:11,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:11,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-04 18:22:11,370 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:11,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1722457971, now seen corresponding path program 1 times [2020-12-04 18:22:11,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:11,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663357588] [2020-12-04 18:22:11,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:22:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:18,153 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2020-12-04 18:22:18,381 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2020-12-04 18:22:18,539 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2020-12-04 18:22:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:18,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663357588] [2020-12-04 18:22:18,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:18,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-04 18:22:18,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416303000] [2020-12-04 18:22:18,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-04 18:22:18,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:18,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-04 18:22:18,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:22:18,736 INFO L87 Difference]: Start difference. First operand 160 states and 180 transitions. Second operand 11 states. [2020-12-04 18:22:25,314 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-12-04 18:22:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:25,771 INFO L93 Difference]: Finished difference Result 176 states and 195 transitions. [2020-12-04 18:22:25,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-04 18:22:25,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2020-12-04 18:22:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:25,773 INFO L225 Difference]: With dead ends: 176 [2020-12-04 18:22:25,774 INFO L226 Difference]: Without dead ends: 142 [2020-12-04 18:22:25,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2020-12-04 18:22:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-04 18:22:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-12-04 18:22:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-04 18:22:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2020-12-04 18:22:25,785 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 40 [2020-12-04 18:22:25,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:25,785 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2020-12-04 18:22:25,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-04 18:22:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2020-12-04 18:22:25,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-04 18:22:25,786 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:25,786 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:25,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-04 18:22:25,786 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:25,787 INFO L82 PathProgramCache]: Analyzing trace with hash -147813803, now seen corresponding path program 1 times [2020-12-04 18:22:25,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:25,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785158180] [2020-12-04 18:22:25,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:22:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:26,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785158180] [2020-12-04 18:22:26,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:26,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:22:26,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231056994] [2020-12-04 18:22:26,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:22:26,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:22:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:22:26,031 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 4 states. [2020-12-04 18:22:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:26,087 INFO L93 Difference]: Finished difference Result 254 states and 287 transitions. [2020-12-04 18:22:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 18:22:26,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-12-04 18:22:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:26,090 INFO L225 Difference]: With dead ends: 254 [2020-12-04 18:22:26,091 INFO L226 Difference]: Without dead ends: 142 [2020-12-04 18:22:26,091 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:22:26,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-12-04 18:22:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2020-12-04 18:22:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-12-04 18:22:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 159 transitions. [2020-12-04 18:22:26,102 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 159 transitions. Word has length 40 [2020-12-04 18:22:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:26,103 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 159 transitions. [2020-12-04 18:22:26,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:22:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 159 transitions. [2020-12-04 18:22:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-04 18:22:26,103 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:26,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:26,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-04 18:22:26,104 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:26,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:26,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1440534099, now seen corresponding path program 1 times [2020-12-04 18:22:26,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:26,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449296408] [2020-12-04 18:22:26,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:22:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:26,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449296408] [2020-12-04 18:22:26,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:26,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:22:26,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656367789] [2020-12-04 18:22:26,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:22:26,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:22:26,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:22:26,478 INFO L87 Difference]: Start difference. First operand 142 states and 159 transitions. Second operand 9 states. [2020-12-04 18:22:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:29,168 INFO L93 Difference]: Finished difference Result 265 states and 297 transitions. [2020-12-04 18:22:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-04 18:22:29,170 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2020-12-04 18:22:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:29,171 INFO L225 Difference]: With dead ends: 265 [2020-12-04 18:22:29,172 INFO L226 Difference]: Without dead ends: 137 [2020-12-04 18:22:29,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2020-12-04 18:22:29,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2020-12-04 18:22:29,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2020-12-04 18:22:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-12-04 18:22:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 152 transitions. [2020-12-04 18:22:29,182 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 152 transitions. Word has length 40 [2020-12-04 18:22:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:29,183 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 152 transitions. [2020-12-04 18:22:29,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:22:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 152 transitions. [2020-12-04 18:22:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-04 18:22:29,184 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:29,184 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:29,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-04 18:22:29,184 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2110548711, now seen corresponding path program 1 times [2020-12-04 18:22:29,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:29,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313473965] [2020-12-04 18:22:29,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:22:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:33,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313473965] [2020-12-04 18:22:33,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:33,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:22:33,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373329667] [2020-12-04 18:22:33,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:22:33,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:33,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:22:33,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:22:33,534 INFO L87 Difference]: Start difference. First operand 137 states and 152 transitions. Second operand 7 states. [2020-12-04 18:22:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:35,961 INFO L93 Difference]: Finished difference Result 223 states and 248 transitions. [2020-12-04 18:22:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:22:35,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2020-12-04 18:22:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:35,964 INFO L225 Difference]: With dead ends: 223 [2020-12-04 18:22:35,965 INFO L226 Difference]: Without dead ends: 123 [2020-12-04 18:22:35,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:22:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-04 18:22:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-12-04 18:22:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-12-04 18:22:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2020-12-04 18:22:35,975 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 41 [2020-12-04 18:22:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:35,976 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2020-12-04 18:22:35,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:22:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2020-12-04 18:22:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-04 18:22:35,976 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:35,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:35,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-04 18:22:35,977 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:35,978 INFO L82 PathProgramCache]: Analyzing trace with hash -544849277, now seen corresponding path program 1 times [2020-12-04 18:22:35,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:35,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725620109] [2020-12-04 18:22:35,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:22:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:36,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725620109] [2020-12-04 18:22:36,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:36,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-04 18:22:36,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671118974] [2020-12-04 18:22:36,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-04 18:22:36,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:36,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-04 18:22:36,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-04 18:22:36,228 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand 4 states. [2020-12-04 18:22:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:36,327 INFO L93 Difference]: Finished difference Result 194 states and 213 transitions. [2020-12-04 18:22:36,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-04 18:22:36,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-12-04 18:22:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:36,329 INFO L225 Difference]: With dead ends: 194 [2020-12-04 18:22:36,329 INFO L226 Difference]: Without dead ends: 103 [2020-12-04 18:22:36,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-04 18:22:36,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-12-04 18:22:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2020-12-04 18:22:36,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-12-04 18:22:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2020-12-04 18:22:36,339 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 54 [2020-12-04 18:22:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:36,339 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2020-12-04 18:22:36,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-04 18:22:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2020-12-04 18:22:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-04 18:22:36,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:36,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:36,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-04 18:22:36,341 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1872836840, now seen corresponding path program 1 times [2020-12-04 18:22:36,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:36,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504162478] [2020-12-04 18:22:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:22:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:41,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504162478] [2020-12-04 18:22:41,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:41,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:22:41,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979775534] [2020-12-04 18:22:41,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:22:41,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:41,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:22:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:22:41,134 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 9 states. [2020-12-04 18:22:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:47,612 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-12-04 18:22:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:22:47,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2020-12-04 18:22:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:47,614 INFO L225 Difference]: With dead ends: 109 [2020-12-04 18:22:47,615 INFO L226 Difference]: Without dead ends: 79 [2020-12-04 18:22:47,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:22:47,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-04 18:22:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-04 18:22:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-04 18:22:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2020-12-04 18:22:47,623 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 60 [2020-12-04 18:22:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:47,623 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2020-12-04 18:22:47,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:22:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2020-12-04 18:22:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-04 18:22:47,624 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:47,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:47,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-04 18:22:47,625 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:47,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash 989120274, now seen corresponding path program 1 times [2020-12-04 18:22:47,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:47,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084591735] [2020-12-04 18:22:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:22:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:22:51,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:22:51,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084591735] [2020-12-04 18:22:51,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:22:51,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-04 18:22:51,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990903636] [2020-12-04 18:22:51,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-04 18:22:51,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:22:51,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-04 18:22:51,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:22:51,152 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 9 states. [2020-12-04 18:22:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:22:57,822 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2020-12-04 18:22:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-04 18:22:57,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2020-12-04 18:22:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:22:57,826 INFO L225 Difference]: With dead ends: 96 [2020-12-04 18:22:57,826 INFO L226 Difference]: Without dead ends: 79 [2020-12-04 18:22:57,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-12-04 18:22:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-12-04 18:22:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-12-04 18:22:57,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-12-04 18:22:57,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2020-12-04 18:22:57,833 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 60 [2020-12-04 18:22:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:22:57,833 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2020-12-04 18:22:57,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-04 18:22:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2020-12-04 18:22:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-04 18:22:57,834 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:22:57,834 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:22:57,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-04 18:22:57,835 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:22:57,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:22:57,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1664554699, now seen corresponding path program 1 times [2020-12-04 18:22:57,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:22:57,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747346228] [2020-12-04 18:22:57,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:23:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:23:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:23:00,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747346228] [2020-12-04 18:23:00,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:23:00,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:23:00,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672509686] [2020-12-04 18:23:00,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:23:00,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:23:00,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:23:00,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:23:00,720 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 8 states. [2020-12-04 18:23:03,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:23:03,132 INFO L93 Difference]: Finished difference Result 89 states and 88 transitions. [2020-12-04 18:23:03,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 18:23:03,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2020-12-04 18:23:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:23:03,134 INFO L225 Difference]: With dead ends: 89 [2020-12-04 18:23:03,134 INFO L226 Difference]: Without dead ends: 71 [2020-12-04 18:23:03,135 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-12-04 18:23:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-12-04 18:23:03,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-12-04 18:23:03,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-12-04 18:23:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 70 transitions. [2020-12-04 18:23:03,141 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 70 transitions. Word has length 62 [2020-12-04 18:23:03,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:23:03,141 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 70 transitions. [2020-12-04 18:23:03,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:23:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 70 transitions. [2020-12-04 18:23:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-04 18:23:03,142 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:23:03,143 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:23:03,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-04 18:23:03,143 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:23:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:23:03,144 INFO L82 PathProgramCache]: Analyzing trace with hash 688239921, now seen corresponding path program 1 times [2020-12-04 18:23:03,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:23:03,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855740510] [2020-12-04 18:23:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:23:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:23:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:23:03,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855740510] [2020-12-04 18:23:03,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:23:03,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-04 18:23:03,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980901887] [2020-12-04 18:23:03,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-04 18:23:03,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:23:03,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-04 18:23:03,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-04 18:23:03,857 INFO L87 Difference]: Start difference. First operand 71 states and 70 transitions. Second operand 8 states. [2020-12-04 18:23:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:23:06,309 INFO L93 Difference]: Finished difference Result 71 states and 70 transitions. [2020-12-04 18:23:06,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 18:23:06,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2020-12-04 18:23:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:23:06,311 INFO L225 Difference]: With dead ends: 71 [2020-12-04 18:23:06,311 INFO L226 Difference]: Without dead ends: 69 [2020-12-04 18:23:06,312 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-04 18:23:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-04 18:23:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-12-04 18:23:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-04 18:23:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 68 transitions. [2020-12-04 18:23:06,317 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 68 transitions. Word has length 66 [2020-12-04 18:23:06,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:23:06,317 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 68 transitions. [2020-12-04 18:23:06,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-04 18:23:06,317 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions. [2020-12-04 18:23:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-04 18:23:06,318 INFO L414 BasicCegarLoop]: Found error trace [2020-12-04 18:23:06,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-04 18:23:06,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-04 18:23:06,319 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-04 18:23:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-04 18:23:06,320 INFO L82 PathProgramCache]: Analyzing trace with hash -26268109, now seen corresponding path program 1 times [2020-12-04 18:23:06,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-04 18:23:06,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468190339] [2020-12-04 18:23:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-04 18:23:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-04 18:23:11,232 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2020-12-04 18:23:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-04 18:23:11,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468190339] [2020-12-04 18:23:11,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-04 18:23:11,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-04 18:23:11,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400940970] [2020-12-04 18:23:11,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-04 18:23:11,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-04 18:23:11,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-04 18:23:11,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-04 18:23:11,513 INFO L87 Difference]: Start difference. First operand 69 states and 68 transitions. Second operand 7 states. [2020-12-04 18:23:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-04 18:23:11,891 INFO L93 Difference]: Finished difference Result 69 states and 68 transitions. [2020-12-04 18:23:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-04 18:23:11,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-12-04 18:23:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-04 18:23:11,892 INFO L225 Difference]: With dead ends: 69 [2020-12-04 18:23:11,892 INFO L226 Difference]: Without dead ends: 0 [2020-12-04 18:23:11,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-12-04 18:23:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-04 18:23:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-04 18:23:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-04 18:23:11,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-04 18:23:11,895 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2020-12-04 18:23:11,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-04 18:23:11,895 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-04 18:23:11,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-04 18:23:11,895 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-04 18:23:11,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-04 18:23:11,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-04 18:23:11,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-04 18:23:12,121 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 158 [2020-12-04 18:23:12,435 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2020-12-04 18:23:13,494 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2020-12-04 18:23:13,664 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-12-04 18:23:13,891 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2020-12-04 18:23:14,033 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-12-04 18:23:14,229 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-12-04 18:23:14,489 WARN L197 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 24 [2020-12-04 18:23:16,476 WARN L197 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 157 DAG size of output: 73 [2020-12-04 18:23:16,616 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2020-12-04 18:23:17,572 WARN L197 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 77 [2020-12-04 18:23:17,579 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,579 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-04 18:23:17,580 INFO L265 CegarLoopResult]: At program point L8757(line 8757) the Hoare annotation is: true [2020-12-04 18:23:17,580 INFO L262 CegarLoopResult]: For program point L8741(lines 8741 8756) no Hoare annotation was computed. [2020-12-04 18:23:17,580 INFO L262 CegarLoopResult]: For program point L6894(lines 6894 6896) no Hoare annotation was computed. [2020-12-04 18:23:17,580 INFO L258 CegarLoopResult]: At program point L6894-3(lines 6893 6897) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= (* (div ULTIMATE.start_aws_byte_buf_init_~capacity 4294967296) 4294967296) ULTIMATE.start_aws_byte_buf_init_~capacity)) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-04 18:23:17,580 INFO L262 CegarLoopResult]: For program point L6894-2(lines 6894 6896) no Hoare annotation was computed. [2020-12-04 18:23:17,580 INFO L262 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:23:17,581 INFO L262 CegarLoopResult]: For program point L222-1(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:23:17,581 INFO L262 CegarLoopResult]: For program point L222-2(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:23:17,581 INFO L262 CegarLoopResult]: For program point L222-3(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:23:17,581 INFO L262 CegarLoopResult]: For program point L222-4(lines 222 224) no Hoare annotation was computed. [2020-12-04 18:23:17,581 INFO L262 CegarLoopResult]: For program point L7159-1(line 7159) no Hoare annotation was computed. [2020-12-04 18:23:17,582 INFO L262 CegarLoopResult]: For program point L7159(lines 7159 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,582 INFO L262 CegarLoopResult]: For program point L7159-4(lines 7159 7160) no Hoare annotation was computed. [2020-12-04 18:23:17,582 INFO L262 CegarLoopResult]: For program point L7159-3(line 7159) no Hoare annotation was computed. [2020-12-04 18:23:17,582 INFO L262 CegarLoopResult]: For program point L6928-2(lines 6928 6930) no Hoare annotation was computed. [2020-12-04 18:23:17,582 INFO L262 CegarLoopResult]: For program point L7159-9(lines 7159 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,582 INFO L262 CegarLoopResult]: For program point L6928(lines 6928 6930) no Hoare annotation was computed. [2020-12-04 18:23:17,582 INFO L262 CegarLoopResult]: For program point L7159-7(lines 7159 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,583 INFO L262 CegarLoopResult]: For program point L7159-6(lines 7159 7160) no Hoare annotation was computed. [2020-12-04 18:23:17,583 INFO L262 CegarLoopResult]: For program point L7159-13(lines 7159 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,583 INFO L258 CegarLoopResult]: At program point L7159-12(lines 7157 7163) the Hoare annotation is: (let ((.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 16)) (.cse17 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse1 (select .cse17 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse5 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse6 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse16))) (.cse7 (= (select .cse17 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse10 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse9 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse11 (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse13 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse16) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base)) (.cse14 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity))) (or (and .cse0 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= .cse1 (+ (* 4294967296 (div (+ .cse1 (- 1)) 4294967296)) 4294967295)) .cse14) (let ((.cse15 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4))) (and .cse0 .cse2 .cse3 .cse4 (<= .cse1 (* 4294967296 (div .cse1 4294967296))) .cse5 .cse6 .cse7 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse15) 0) .cse8 (<= ULTIMATE.start_aws_byte_buf_init_~capacity (* 4294967296 (div ULTIMATE.start_aws_byte_buf_init_~capacity 4294967296))) .cse10 .cse9 .cse11 .cse12 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse15) 0) .cse13 .cse14))))) [2020-12-04 18:23:17,584 INFO L262 CegarLoopResult]: For program point L7159-11(lines 7159 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,584 INFO L262 CegarLoopResult]: For program point L7159-17(lines 7159 7160) no Hoare annotation was computed. [2020-12-04 18:23:17,584 INFO L262 CegarLoopResult]: For program point L7159-16(line 7159) no Hoare annotation was computed. [2020-12-04 18:23:17,584 INFO L262 CegarLoopResult]: For program point L7159-14(line 7159) no Hoare annotation was computed. [2020-12-04 18:23:17,584 INFO L262 CegarLoopResult]: For program point L7159-20(lines 7159 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,585 INFO L262 CegarLoopResult]: For program point L7159-19(lines 7159 7160) no Hoare annotation was computed. [2020-12-04 18:23:17,585 INFO L258 CegarLoopResult]: At program point L7159-25(lines 7157 7163) the Hoare annotation is: (let ((.cse1 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse16 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 16))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse3 (<= 1 |ULTIMATE.start_aws_byte_buf_is_valid_#res|)) (.cse4 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse5 (<= |ULTIMATE.start_aws_byte_buf_is_valid_#res| 1)) (.cse6 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse16))) (.cse7 (= (select .cse1 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|)) (.cse9 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| 0))) (.cse10 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse11 (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0))) (.cse12 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse13 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse16) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base)) (.cse14 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity))) (or (and .cse0 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 (select .cse1 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0) .cse11 .cse12 .cse13 .cse14) (and (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 (* 4294967296 (div ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 4294967296))) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 (let ((.cse15 (select (select |#memory_int| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 12)))) (+ .cse15 (* 4294967296 (div (+ (* .cse15 (- 1)) ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1) 4294967296))))) .cse14)))) [2020-12-04 18:23:17,585 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-04 18:23:17,585 INFO L262 CegarLoopResult]: For program point L7159-24(lines 7159 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,585 INFO L262 CegarLoopResult]: For program point L223(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,585 INFO L262 CegarLoopResult]: For program point L223-1(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,585 INFO L262 CegarLoopResult]: For program point L7159-22(lines 7159 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,586 INFO L262 CegarLoopResult]: For program point L223-3(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,586 INFO L262 CegarLoopResult]: For program point L223-4(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,586 INFO L262 CegarLoopResult]: For program point L223-6(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,586 INFO L258 CegarLoopResult]: At program point L7127(lines 7110 7128) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 16)) (.cse16 (select |#memory_int| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base))) (let ((.cse0 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base)) (.cse2 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base)) (.cse1 (select .cse16 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 12))) (.cse4 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse15))) (.cse5 (= (select .cse16 ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset) 0)) (.cse8 (= ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 0)) (.cse9 (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset)) (.cse11 (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base)) (.cse12 (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base|) .cse15) ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base)) (.cse13 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) (.cse6 (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| 0))) (.cse7 (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0)) (.cse3 (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) (.cse10 (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)))) (or (and .cse0 (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse1 (+ (* 4294967296 (div (+ .cse1 (- 1)) 4294967296)) 4294967295)) .cse13) (let ((.cse14 (+ ULTIMATE.start_aws_byte_buf_is_valid_~buf.offset 4))) (and .cse0 .cse2 .cse3 (<= .cse1 (* 4294967296 (div .cse1 4294967296))) .cse4 .cse5 (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse14) 0) .cse6 (<= ULTIMATE.start_aws_byte_buf_init_~capacity (* 4294967296 (div ULTIMATE.start_aws_byte_buf_init_~capacity 4294967296))) .cse7 .cse8 .cse9 .cse10 .cse11 (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_aws_byte_buf_is_valid_~buf.base) .cse14) 0) .cse12 .cse13)) (and (<= (+ |ULTIMATE.start_aws_byte_buf_init_#res| 1) 0) .cse6 .cse7 .cse3 .cse10)))) [2020-12-04 18:23:17,586 INFO L262 CegarLoopResult]: For program point L223-7(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,586 INFO L262 CegarLoopResult]: For program point L223-9(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,586 INFO L262 CegarLoopResult]: For program point L223-10(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,586 INFO L262 CegarLoopResult]: For program point L223-12(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,587 INFO L262 CegarLoopResult]: For program point L223-13(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,587 INFO L258 CegarLoopResult]: At program point L6880(lines 6876 6881) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= (* (div ULTIMATE.start_aws_byte_buf_init_~capacity 4294967296) 4294967296) ULTIMATE.start_aws_byte_buf_init_~capacity)) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-04 18:23:17,587 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,587 INFO L262 CegarLoopResult]: For program point L7162(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,587 INFO L262 CegarLoopResult]: For program point L7162-4(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,587 INFO L262 CegarLoopResult]: For program point L7162-3(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,587 INFO L262 CegarLoopResult]: For program point L7162-2(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,587 INFO L262 CegarLoopResult]: For program point L7162-8(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,587 INFO L258 CegarLoopResult]: At program point L6931(lines 6922 6932) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (< (* 4294967296 (div ULTIMATE.start_aws_byte_buf_init_~capacity 4294967296)) ULTIMATE.start_aws_byte_buf_init_~capacity) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-04 18:23:17,588 INFO L262 CegarLoopResult]: For program point L7162-6(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,588 INFO L262 CegarLoopResult]: For program point L7162-12(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,588 INFO L262 CegarLoopResult]: For program point L7162-11(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,588 INFO L262 CegarLoopResult]: For program point L7162-9(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,588 INFO L262 CegarLoopResult]: For program point L7162-15(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,588 INFO L262 CegarLoopResult]: For program point L7162-13(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,588 INFO L262 CegarLoopResult]: For program point L7162-17(line 7162) no Hoare annotation was computed. [2020-12-04 18:23:17,589 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,589 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-04 18:23:17,589 INFO L262 CegarLoopResult]: For program point L210(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:23:17,589 INFO L262 CegarLoopResult]: For program point L210-1(lines 7114 7116) no Hoare annotation was computed. [2020-12-04 18:23:17,589 INFO L262 CegarLoopResult]: For program point L8749(lines 8749 8755) no Hoare annotation was computed. [2020-12-04 18:23:17,589 INFO L262 CegarLoopResult]: For program point L210-2(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:23:17,590 INFO L262 CegarLoopResult]: For program point L210-3(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:23:17,590 INFO L262 CegarLoopResult]: For program point L8749-2(lines 8749 8755) no Hoare annotation was computed. [2020-12-04 18:23:17,590 INFO L262 CegarLoopResult]: For program point L210-4(lines 210 212) no Hoare annotation was computed. [2020-12-04 18:23:17,590 INFO L262 CegarLoopResult]: For program point L7114-1(lines 7114 7116) no Hoare annotation was computed. [2020-12-04 18:23:17,590 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,590 INFO L262 CegarLoopResult]: For program point L211(line 211) no Hoare annotation was computed. [2020-12-04 18:23:17,591 INFO L262 CegarLoopResult]: For program point L211-2(line 211) no Hoare annotation was computed. [2020-12-04 18:23:17,591 INFO L262 CegarLoopResult]: For program point L211-4(line 211) no Hoare annotation was computed. [2020-12-04 18:23:17,591 INFO L262 CegarLoopResult]: For program point L211-6(line 211) no Hoare annotation was computed. [2020-12-04 18:23:17,591 INFO L262 CegarLoopResult]: For program point L211-8(line 211) no Hoare annotation was computed. [2020-12-04 18:23:17,591 INFO L258 CegarLoopResult]: At program point L261(line 261) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= (* (div ULTIMATE.start_aws_byte_buf_init_~capacity 4294967296) 4294967296) ULTIMATE.start_aws_byte_buf_init_~capacity)) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-04 18:23:17,592 INFO L258 CegarLoopResult]: At program point L6884-1(lines 6883 6885) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= (* (div ULTIMATE.start_aws_byte_buf_init_~capacity 4294967296) 4294967296) ULTIMATE.start_aws_byte_buf_init_~capacity)) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-04 18:23:17,592 INFO L258 CegarLoopResult]: At program point L6884(lines 6883 6885) the Hoare annotation is: (and (not (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| 0)) (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset| 0)) [2020-12-04 18:23:17,592 INFO L262 CegarLoopResult]: For program point L7099(lines 7099 7101) no Hoare annotation was computed. [2020-12-04 18:23:17,592 INFO L262 CegarLoopResult]: For program point L7117-2(lines 7117 7121) no Hoare annotation was computed. [2020-12-04 18:23:17,592 INFO L262 CegarLoopResult]: For program point L7117(lines 7117 7118) no Hoare annotation was computed. [2020-12-04 18:23:17,593 INFO L258 CegarLoopResult]: At program point L6919(lines 6917 6920) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= (* (div ULTIMATE.start_aws_byte_buf_init_~capacity 4294967296) 4294967296) ULTIMATE.start_aws_byte_buf_init_~capacity)) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-04 18:23:17,593 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-04 18:23:17,593 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2020-12-04 18:23:17,593 INFO L258 CegarLoopResult]: At program point L1998(lines 1988 1999) the Hoare annotation is: (and (= |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.base| ULTIMATE.start_aws_byte_buf_init_~buf.base) (= ULTIMATE.start_aws_mem_acquire_~mem~0.base 0) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset 0) (not (= (* (div ULTIMATE.start_aws_byte_buf_init_~capacity 4294967296) 4294967296) ULTIMATE.start_aws_byte_buf_init_~capacity)) (= ULTIMATE.start_aws_byte_buf_init_~allocator.offset ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.offset) (not (= ULTIMATE.start_aws_byte_buf_init_~buf.base 0)) (= ULTIMATE.start_aws_mem_acquire_~mem~0.offset 0) (= ULTIMATE.start_aws_byte_buf_init_harness_~allocator~0.base ULTIMATE.start_aws_byte_buf_init_~allocator.base) (= ULTIMATE.start_aws_byte_buf_init_~buf.offset |ULTIMATE.start_aws_byte_buf_init_harness_~#buf~3.offset|) (= ULTIMATE.start_aws_byte_buf_init_harness_~capacity~1 ULTIMATE.start_aws_byte_buf_init_~capacity)) [2020-12-04 18:23:17,617 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,619 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,620 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,620 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,621 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,621 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,625 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,626 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,627 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,628 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,628 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,640 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,642 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,645 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,646 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,646 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,647 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,650 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,651 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,652 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,652 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,653 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,653 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,656 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,657 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,657 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,658 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,658 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:17,659 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:17,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.12 06:23:17 BoogieIcfgContainer [2020-12-04 18:23:17,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-04 18:23:17,665 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-04 18:23:17,666 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-04 18:23:17,666 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-04 18:23:17,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 06:21:04" (3/4) ... [2020-12-04 18:23:17,671 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-04 18:23:17,702 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 125 nodes and edges [2020-12-04 18:23:17,704 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2020-12-04 18:23:17,707 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2020-12-04 18:23:17,709 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-12-04 18:23:17,711 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2020-12-04 18:23:17,713 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-12-04 18:23:17,714 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-04 18:23:17,716 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-04 18:23:17,763 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((buf == buf && capacity == unknown-#memory_int-unknown[buf][buf + 12]) && buf == buf) && buf == 0) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && !(buf == 0)) && buf == 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 16] == allocator) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) && capacity == capacity) || ((((((((((((((((buf == buf && buf == buf) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf + 12] / 4294967296)) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 4] == 0) && !(buf == 0)) && capacity <= 4294967296 * (capacity / 4294967296)) && buf == 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 4] == 0) && #memory_$Pointer$[buf][buf + 16] == allocator) && capacity == capacity)) || ((((\result + 1 <= 0 && !(buf == 0)) && buf == 0) && buf == 0) && !(buf == 0)) [2020-12-04 18:23:17,765 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((buf == buf && capacity == unknown-#memory_int-unknown[buf][buf + 12]) && buf == buf) && 1 <= \result) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 16] == allocator) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) && capacity == capacity) || (((((((((((((((((buf == buf && buf == buf) && 1 <= \result) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf + 12] / 4294967296)) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 4] == 0) && buf == buf) && capacity <= 4294967296 * (capacity / 4294967296)) && allocator == allocator) && buf == 0) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 4] == 0) && #memory_$Pointer$[buf][buf + 16] == allocator) && capacity == capacity) [2020-12-04 18:23:17,766 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((buf == buf && capacity == unknown-#memory_int-unknown[buf][buf + 12]) && buf == buf) && 1 <= \result) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && !(buf == 0)) && allocator == allocator) && buf == 0) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 16] == allocator) && capacity == capacity) || ((((((((((((((((buf == buf && buf == buf) && buf == buf) && 1 <= \result) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && capacity <= 4294967296 * (capacity / 4294967296)) && buf == buf) && !(buf == 0)) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 16] == allocator) && capacity <= unknown-#memory_int-unknown[buf][buf + 12] + 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] * -1 + capacity) / 4294967296)) && capacity == capacity) [2020-12-04 18:23:19,256 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-04 18:23:19,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-04 18:23:19,258 INFO L168 Benchmark]: Toolchain (without parser) took 152655.50 ms. Allocated memory was 46.1 MB in the beginning and 1.2 GB in the end (delta: 1.2 GB). Free memory was 24.2 MB in the beginning and 1.0 GB in the end (delta: -997.2 MB). Peak memory consumption was 789.4 MB. Max. memory is 16.1 GB. [2020-12-04 18:23:19,259 INFO L168 Benchmark]: CDTParser took 0.91 ms. Allocated memory is still 46.1 MB. Free memory was 28.1 MB in the beginning and 28.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-04 18:23:19,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 4472.07 ms. Allocated memory was 46.1 MB in the beginning and 109.1 MB in the end (delta: 62.9 MB). Free memory was 23.9 MB in the beginning and 35.4 MB in the end (delta: -11.5 MB). Peak memory consumption was 73.9 MB. Max. memory is 16.1 GB. [2020-12-04 18:23:19,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 322.39 ms. Allocated memory is still 109.1 MB. Free memory was 35.4 MB in the beginning and 23.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-04 18:23:19,260 INFO L168 Benchmark]: Boogie Preprocessor took 157.74 ms. Allocated memory is still 109.1 MB. Free memory was 23.8 MB in the beginning and 59.0 MB in the end (delta: -35.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2020-12-04 18:23:19,261 INFO L168 Benchmark]: RCFGBuilder took 12787.38 ms. Allocated memory was 109.1 MB in the beginning and 518.0 MB in the end (delta: 408.9 MB). Free memory was 59.0 MB in the beginning and 177.3 MB in the end (delta: -118.3 MB). Peak memory consumption was 295.4 MB. Max. memory is 16.1 GB. [2020-12-04 18:23:19,261 INFO L168 Benchmark]: TraceAbstraction took 133316.05 ms. Allocated memory was 518.0 MB in the beginning and 1.2 GB in the end (delta: 706.7 MB). Free memory was 177.3 MB in the beginning and 1.1 GB in the end (delta: -940.3 MB). Peak memory consumption was 446.9 MB. Max. memory is 16.1 GB. [2020-12-04 18:23:19,261 INFO L168 Benchmark]: Witness Printer took 1591.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.2 MB). Peak memory consumption was 702.5 MB. Max. memory is 16.1 GB. [2020-12-04 18:23:19,264 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.91 ms. Allocated memory is still 46.1 MB. Free memory was 28.1 MB in the beginning and 28.0 MB in the end (delta: 63.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 4472.07 ms. Allocated memory was 46.1 MB in the beginning and 109.1 MB in the end (delta: 62.9 MB). Free memory was 23.9 MB in the beginning and 35.4 MB in the end (delta: -11.5 MB). Peak memory consumption was 73.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 322.39 ms. Allocated memory is still 109.1 MB. Free memory was 35.4 MB in the beginning and 23.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 157.74 ms. Allocated memory is still 109.1 MB. Free memory was 23.8 MB in the beginning and 59.0 MB in the end (delta: -35.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 12787.38 ms. Allocated memory was 109.1 MB in the beginning and 518.0 MB in the end (delta: 408.9 MB). Free memory was 59.0 MB in the beginning and 177.3 MB in the end (delta: -118.3 MB). Peak memory consumption was 295.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 133316.05 ms. Allocated memory was 518.0 MB in the beginning and 1.2 GB in the end (delta: 706.7 MB). Free memory was 177.3 MB in the beginning and 1.1 GB in the end (delta: -940.3 MB). Peak memory consumption was 446.9 MB. Max. memory is 16.1 GB. * Witness Printer took 1591.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.2 MB). Peak memory consumption was 702.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 1988]: Loop Invariant Derived loop invariant: ((((((((buf == buf && mem == 0) && buf == 0) && !(capacity / 4294967296 * 4294967296 == capacity)) && allocator == allocator) && !(buf == 0)) && mem == 0) && allocator == allocator) && buf == buf) && capacity == capacity - InvariantResult [Line: 7157]: Loop Invariant [2020-12-04 18:23:19,278 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,279 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,280 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,283 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,285 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,286 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,287 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((buf == buf && capacity == unknown-#memory_int-unknown[buf][buf + 12]) && buf == buf) && 1 <= \result) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 16] == allocator) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) && capacity == capacity) || (((((((((((((((((buf == buf && buf == buf) && 1 <= \result) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf + 12] / 4294967296)) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 4] == 0) && buf == buf) && capacity <= 4294967296 * (capacity / 4294967296)) && allocator == allocator) && buf == 0) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 4] == 0) && #memory_$Pointer$[buf][buf + 16] == allocator) && capacity == capacity) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((buf == buf && buf == 0) && allocator == allocator) && !(capacity / 4294967296 * 4294967296 == capacity)) && !(buf == 0)) && allocator == allocator) && buf == buf) && capacity == capacity - InvariantResult [Line: 6893]: Loop Invariant Derived loop invariant: ((((((buf == buf && buf == 0) && allocator == allocator) && !(capacity / 4294967296 * 4294967296 == capacity)) && !(buf == 0)) && allocator == allocator) && buf == buf) && capacity == capacity - InvariantResult [Line: 6876]: Loop Invariant Derived loop invariant: ((((((buf == buf && buf == 0) && allocator == allocator) && !(capacity / 4294967296 * 4294967296 == capacity)) && !(buf == 0)) && allocator == allocator) && buf == buf) && capacity == capacity - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6883]: Loop Invariant Derived loop invariant: !(buf == 0) && buf == 0 - InvariantResult [Line: 6883]: Loop Invariant Derived loop invariant: ((((((buf == buf && buf == 0) && allocator == allocator) && !(capacity / 4294967296 * 4294967296 == capacity)) && !(buf == 0)) && allocator == allocator) && buf == buf) && capacity == capacity - InvariantResult [Line: 6922]: Loop Invariant Derived loop invariant: ((((((buf == buf && buf == 0) && 4294967296 * (capacity / 4294967296) < capacity) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && buf == buf) && capacity == capacity - InvariantResult [Line: 7157]: Loop Invariant [2020-12-04 18:23:19,298 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,299 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,299 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,300 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,301 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,302 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,302 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((buf == buf && capacity == unknown-#memory_int-unknown[buf][buf + 12]) && buf == buf) && 1 <= \result) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && buf == buf) && !(buf == 0)) && allocator == allocator) && buf == 0) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 16] == allocator) && capacity == capacity) || ((((((((((((((((buf == buf && buf == buf) && buf == buf) && 1 <= \result) && buf == 0) && \result <= 1) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && capacity <= 4294967296 * (capacity / 4294967296)) && buf == buf) && !(buf == 0)) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 16] == allocator) && capacity <= unknown-#memory_int-unknown[buf][buf + 12] + 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] * -1 + capacity) / 4294967296)) && capacity == capacity) - InvariantResult [Line: 6917]: Loop Invariant Derived loop invariant: ((((((buf == buf && buf == 0) && allocator == allocator) && !(capacity / 4294967296 * 4294967296 == capacity)) && !(buf == 0)) && allocator == allocator) && buf == buf) && capacity == capacity - InvariantResult [Line: 7110]: Loop Invariant [2020-12-04 18:23:19,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,305 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,306 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,307 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,308 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-12-04 18:23:19,309 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-12-04 18:23:19,309 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base Derived loop invariant: (((((((((((((((buf == buf && capacity == unknown-#memory_int-unknown[buf][buf + 12]) && buf == buf) && buf == 0) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && !(buf == 0)) && buf == 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 16] == allocator) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * ((unknown-#memory_int-unknown[buf][buf + 12] + -1) / 4294967296) + 4294967295) && capacity == capacity) || ((((((((((((((((buf == buf && buf == buf) && buf == 0) && unknown-#memory_int-unknown[buf][buf + 12] <= 4294967296 * (unknown-#memory_int-unknown[buf][buf + 12] / 4294967296)) && allocator == #memory_$Pointer$[buf][buf + 16]) && unknown-#memory_int-unknown[buf][buf] == 0) && #memory_$Pointer$[buf][buf + 4] == 0) && !(buf == 0)) && capacity <= 4294967296 * (capacity / 4294967296)) && buf == 0) && buf == 0) && allocator == allocator) && !(buf == 0)) && allocator == allocator) && #memory_$Pointer$[buf][buf + 4] == 0) && #memory_$Pointer$[buf][buf + 16] == allocator) && capacity == capacity)) || ((((\result + 1 <= 0 && !(buf == 0)) && buf == 0) && buf == 0) && !(buf == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 85 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 127.4s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 63.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2366 SDtfs, 4255 SDslu, 5960 SDs, 0 SdLazy, 1782 SolverSat, 199 SolverUnsat, 25 SolverUnknown, 0 SolverNotchecked, 56.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 616 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 31 NumberOfFragments, 811 HoareAnnotationTreeSize, 12 FomulaSimplifications, 34944 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 12 FomulaSimplificationsInter, 32696 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 50.3s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 1088 NumberOfCodeBlocks, 1088 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1059 ConstructedInterpolants, 0 QuantifiedInterpolants, 374601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...