./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i -s /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d06f524697fe97ff48c3d006beaa8ce1b592c7dd ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i -s /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d06f524697fe97ff48c3d006beaa8ce1b592c7dd .............................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: TYPE ERROR --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:08:51,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:08:51,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:08:51,123 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:08:51,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:08:51,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:08:51,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:08:51,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:08:51,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:08:51,128 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:08:51,129 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:08:51,130 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:08:51,130 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:08:51,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:08:51,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:08:51,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:08:51,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:08:51,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:08:51,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:08:51,136 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:08:51,138 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:08:51,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:08:51,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:08:51,139 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:08:51,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:08:51,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:08:51,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:08:51,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:08:51,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:08:51,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:08:51,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:08:51,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:08:51,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:08:51,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:08:51,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:08:51,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:08:51,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:08:51,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:08:51,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:08:51,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:08:51,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:08:51,147 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-12-07 16:08:51,156 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:08:51,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:08:51,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:08:51,157 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:08:51,157 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:08:51,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:08:51,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:08:51,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:08:51,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:08:51,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:08:51,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:08:51,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:08:51,158 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:08:51,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:08:51,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:08:51,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:08:51,159 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:08:51,159 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:08:51,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:08:51,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:08:51,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:08:51,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:08:51,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:08:51,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:08:51,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:08:51,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:08:51,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:08:51,160 INFO L138 SettingsManager]: * To the following directory=dump/ 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer 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(__VERIFIER_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 -> d06f524697fe97ff48c3d006beaa8ce1b592c7dd [2019-12-07 16:08:51,261 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:08:51,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:08:51,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:08:51,275 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:08:51,275 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:08:51,276 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2019-12-07 16:08:51,321 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data/f6a4e605a/334396fff0ee4545b8ace03a7e2957cf/FLAG614daf305 [2019-12-07 16:08:51,905 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:08:51,906 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2019-12-07 16:08:51,927 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data/f6a4e605a/334396fff0ee4545b8ace03a7e2957cf/FLAG614daf305 [2019-12-07 16:08:52,347 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data/f6a4e605a/334396fff0ee4545b8ace03a7e2957cf [2019-12-07 16:08:52,349 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:08:52,351 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:08:52,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:52,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:08:52,354 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:08:52,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:52" (1/1) ... [2019-12-07 16:08:52,357 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30100dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:52, skipping insertion in model container [2019-12-07 16:08:52,357 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:08:52" (1/1) ... [2019-12-07 16:08:52,363 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:08:52,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:08:52,642 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2019-12-07 16:08:52,646 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2019-12-07 16:08:53,192 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,193 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,193 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,193 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,194 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,203 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,203 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,205 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,205 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,206 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,207 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,208 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,208 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,511 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2019-12-07 16:08:53,512 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2019-12-07 16:08:53,513 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2019-12-07 16:08:53,514 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2019-12-07 16:08:53,515 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2019-12-07 16:08:53,515 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2019-12-07 16:08:53,516 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2019-12-07 16:08:53,516 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2019-12-07 16:08:53,517 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2019-12-07 16:08:53,517 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2019-12-07 16:08:53,641 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2019-12-07 16:08:53,697 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,698 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,742 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:53,774 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:08:53,784 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2019-12-07 16:08:53,784 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2019-12-07 16:08:53,806 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,806 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,807 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,807 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,807 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,811 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,811 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,812 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,812 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,813 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,813 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,814 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,814 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,835 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2019-12-07 16:08:53,835 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2019-12-07 16:08:53,836 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2019-12-07 16:08:53,836 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2019-12-07 16:08:53,837 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2019-12-07 16:08:53,837 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2019-12-07 16:08:53,837 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2019-12-07 16:08:53,838 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2019-12-07 16:08:53,838 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2019-12-07 16:08:53,838 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2019-12-07 16:08:53,851 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2019-12-07 16:08:53,884 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,885 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:08:53,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:08:54,447 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:08:54,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54 WrapperNode [2019-12-07 16:08:54,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:08:54,448 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:08:54,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:08:54,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:08:54,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... [2019-12-07 16:08:54,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... [2019-12-07 16:08:54,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:08:54,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:08:54,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:08:54,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:08:54,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... [2019-12-07 16:08:54,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... [2019-12-07 16:08:54,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... [2019-12-07 16:08:54,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... [2019-12-07 16:08:54,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... [2019-12-07 16:08:54,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... [2019-12-07 16:08:54,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... [2019-12-07 16:08:54,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:08:54,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:08:54,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:08:54,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:08:54,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/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 [2019-12-07 16:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 16:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 16:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 16:08:54,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:08:54,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 16:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 16:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:08:54,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 16:09:01,830 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:09:01,830 INFO L287 CfgBuilder]: Removed 117 assume(true) statements. [2019-12-07 16:09:01,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:09:01 BoogieIcfgContainer [2019-12-07 16:09:01,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:09:01,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:09:01,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:09:01,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:09:01,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:08:52" (1/3) ... [2019-12-07 16:09:01,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da7add7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:09:01, skipping insertion in model container [2019-12-07 16:09:01,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:08:54" (2/3) ... [2019-12-07 16:09:01,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da7add7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:09:01, skipping insertion in model container [2019-12-07 16:09:01,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:09:01" (3/3) ... [2019-12-07 16:09:01,836 INFO L109 eAbstractionObserver]: Analyzing ICFG aws_byte_buf_advance_harness.i [2019-12-07 16:09:01,842 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:09:01,848 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-12-07 16:09:01,856 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-12-07 16:09:01,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:09:01,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:09:01,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:09:01,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:09:01,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:09:01,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:09:01,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:09:01,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:09:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states. [2019-12-07 16:09:01,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:09:01,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:01,896 INFO L410 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] [2019-12-07 16:09:01,897 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:01,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:01,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1362597507, now seen corresponding path program 1 times [2019-12-07 16:09:01,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:01,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574748600] [2019-12-07 16:09:01,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:02,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574748600] [2019-12-07 16:09:02,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:02,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:09:02,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830864027] [2019-12-07 16:09:02,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:09:02,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:09:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:09:02,377 INFO L87 Difference]: Start difference. First operand 308 states. Second operand 4 states. [2019-12-07 16:09:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:02,569 INFO L93 Difference]: Finished difference Result 594 states and 818 transitions. [2019-12-07 16:09:02,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:09:02,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 16:09:02,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:02,581 INFO L225 Difference]: With dead ends: 594 [2019-12-07 16:09:02,581 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 16:09:02,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:09:02,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 16:09:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-12-07 16:09:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-07 16:09:02,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 390 transitions. [2019-12-07 16:09:02,629 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 390 transitions. Word has length 30 [2019-12-07 16:09:02,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:02,629 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 390 transitions. [2019-12-07 16:09:02,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:09:02,629 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 390 transitions. [2019-12-07 16:09:02,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:09:02,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:02,631 INFO L410 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] [2019-12-07 16:09:02,632 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1576879385, now seen corresponding path program 1 times [2019-12-07 16:09:02,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:02,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755920890] [2019-12-07 16:09:02,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:02,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755920890] [2019-12-07 16:09:02,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:02,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:09:02,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890428981] [2019-12-07 16:09:02,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:09:02,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:02,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:09:02,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:09:02,853 INFO L87 Difference]: Start difference. First operand 303 states and 390 transitions. Second operand 4 states. [2019-12-07 16:09:02,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:02,968 INFO L93 Difference]: Finished difference Result 461 states and 580 transitions. [2019-12-07 16:09:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:09:02,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 16:09:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:02,971 INFO L225 Difference]: With dead ends: 461 [2019-12-07 16:09:02,971 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 16:09:02,972 INFO L630 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 [2019-12-07 16:09:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 16:09:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-12-07 16:09:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-07 16:09:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 389 transitions. [2019-12-07 16:09:02,988 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 389 transitions. Word has length 42 [2019-12-07 16:09:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:02,988 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 389 transitions. [2019-12-07 16:09:02,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:09:02,988 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 389 transitions. [2019-12-07 16:09:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 16:09:02,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:02,991 INFO L410 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] [2019-12-07 16:09:02,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:02,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:02,991 INFO L82 PathProgramCache]: Analyzing trace with hash 864015018, now seen corresponding path program 1 times [2019-12-07 16:09:02,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:02,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331593669] [2019-12-07 16:09:02,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:03,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:03,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331593669] [2019-12-07 16:09:03,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:03,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:09:03,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449520528] [2019-12-07 16:09:03,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:09:03,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:03,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:09:03,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:09:03,273 INFO L87 Difference]: Start difference. First operand 303 states and 389 transitions. Second operand 7 states. [2019-12-07 16:09:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:03,483 INFO L93 Difference]: Finished difference Result 466 states and 584 transitions. [2019-12-07 16:09:03,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:09:03,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-07 16:09:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:03,485 INFO L225 Difference]: With dead ends: 466 [2019-12-07 16:09:03,485 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 16:09:03,486 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:09:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 16:09:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-12-07 16:09:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-07 16:09:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 387 transitions. [2019-12-07 16:09:03,497 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 387 transitions. Word has length 47 [2019-12-07 16:09:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:03,497 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 387 transitions. [2019-12-07 16:09:03,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:09:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 387 transitions. [2019-12-07 16:09:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 16:09:03,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:03,499 INFO L410 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] [2019-12-07 16:09:03,499 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:03,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash -2044907154, now seen corresponding path program 1 times [2019-12-07 16:09:03,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:03,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739763748] [2019-12-07 16:09:03,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:03,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739763748] [2019-12-07 16:09:03,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:03,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:09:03,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241820251] [2019-12-07 16:09:03,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:09:03,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:03,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:09:03,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:09:03,685 INFO L87 Difference]: Start difference. First operand 303 states and 387 transitions. Second operand 5 states. [2019-12-07 16:09:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:03,877 INFO L93 Difference]: Finished difference Result 560 states and 712 transitions. [2019-12-07 16:09:03,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:09:03,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-07 16:09:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:03,879 INFO L225 Difference]: With dead ends: 560 [2019-12-07 16:09:03,880 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 16:09:03,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:09:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 16:09:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2019-12-07 16:09:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-07 16:09:03,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 382 transitions. [2019-12-07 16:09:03,889 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 382 transitions. Word has length 48 [2019-12-07 16:09:03,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:03,890 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 382 transitions. [2019-12-07 16:09:03,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:09:03,890 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 382 transitions. [2019-12-07 16:09:03,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 16:09:03,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:03,891 INFO L410 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] [2019-12-07 16:09:03,892 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:03,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:03,892 INFO L82 PathProgramCache]: Analyzing trace with hash 293455459, now seen corresponding path program 1 times [2019-12-07 16:09:03,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:03,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9136978] [2019-12-07 16:09:03,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:04,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9136978] [2019-12-07 16:09:04,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:04,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:09:04,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718343898] [2019-12-07 16:09:04,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:09:04,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:04,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:09:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:09:04,456 INFO L87 Difference]: Start difference. First operand 303 states and 382 transitions. Second operand 6 states. [2019-12-07 16:09:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:04,946 INFO L93 Difference]: Finished difference Result 538 states and 653 transitions. [2019-12-07 16:09:04,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:09:04,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-07 16:09:04,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:04,949 INFO L225 Difference]: With dead ends: 538 [2019-12-07 16:09:04,950 INFO L226 Difference]: Without dead ends: 517 [2019-12-07 16:09:04,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:09:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-12-07 16:09:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 327. [2019-12-07 16:09:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-07 16:09:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 405 transitions. [2019-12-07 16:09:04,962 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 405 transitions. Word has length 54 [2019-12-07 16:09:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:04,963 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 405 transitions. [2019-12-07 16:09:04,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:09:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 405 transitions. [2019-12-07 16:09:04,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 16:09:04,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:04,964 INFO L410 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] [2019-12-07 16:09:04,964 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash 142931611, now seen corresponding path program 1 times [2019-12-07 16:09:04,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:04,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646583230] [2019-12-07 16:09:04,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:05,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646583230] [2019-12-07 16:09:05,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:05,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:09:05,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064886906] [2019-12-07 16:09:05,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:09:05,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:05,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:09:05,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:09:05,407 INFO L87 Difference]: Start difference. First operand 327 states and 405 transitions. Second operand 7 states. [2019-12-07 16:09:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:11,158 INFO L93 Difference]: Finished difference Result 982 states and 1208 transitions. [2019-12-07 16:09:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:09:11,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-07 16:09:11,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:11,161 INFO L225 Difference]: With dead ends: 982 [2019-12-07 16:09:11,161 INFO L226 Difference]: Without dead ends: 675 [2019-12-07 16:09:11,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:09:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2019-12-07 16:09:11,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 382. [2019-12-07 16:09:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-12-07 16:09:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 481 transitions. [2019-12-07 16:09:11,171 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 481 transitions. Word has length 58 [2019-12-07 16:09:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:11,171 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 481 transitions. [2019-12-07 16:09:11,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:09:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 481 transitions. [2019-12-07 16:09:11,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 16:09:11,172 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:11,172 INFO L410 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] [2019-12-07 16:09:11,172 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:11,172 INFO L82 PathProgramCache]: Analyzing trace with hash 822989981, now seen corresponding path program 1 times [2019-12-07 16:09:11,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:11,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509734365] [2019-12-07 16:09:11,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:11,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:11,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509734365] [2019-12-07 16:09:11,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:11,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:09:11,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049273828] [2019-12-07 16:09:11,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:09:11,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:11,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:09:11,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:09:11,533 INFO L87 Difference]: Start difference. First operand 382 states and 481 transitions. Second operand 6 states. [2019-12-07 16:09:15,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:15,081 INFO L93 Difference]: Finished difference Result 1277 states and 1614 transitions. [2019-12-07 16:09:15,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 16:09:15,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 16:09:15,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:15,086 INFO L225 Difference]: With dead ends: 1277 [2019-12-07 16:09:15,086 INFO L226 Difference]: Without dead ends: 911 [2019-12-07 16:09:15,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:09:15,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2019-12-07 16:09:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 407. [2019-12-07 16:09:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-12-07 16:09:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 507 transitions. [2019-12-07 16:09:15,100 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 507 transitions. Word has length 58 [2019-12-07 16:09:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:15,100 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 507 transitions. [2019-12-07 16:09:15,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:09:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 507 transitions. [2019-12-07 16:09:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 16:09:15,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:15,101 INFO L410 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] [2019-12-07 16:09:15,101 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:15,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:15,102 INFO L82 PathProgramCache]: Analyzing trace with hash 401097049, now seen corresponding path program 1 times [2019-12-07 16:09:15,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:15,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707030562] [2019-12-07 16:09:15,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:15,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707030562] [2019-12-07 16:09:15,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:15,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:09:15,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827214681] [2019-12-07 16:09:15,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:09:15,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:15,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:09:15,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:09:15,429 INFO L87 Difference]: Start difference. First operand 407 states and 507 transitions. Second operand 5 states. [2019-12-07 16:09:18,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:18,751 INFO L93 Difference]: Finished difference Result 1130 states and 1400 transitions. [2019-12-07 16:09:18,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:09:18,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-07 16:09:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:18,754 INFO L225 Difference]: With dead ends: 1130 [2019-12-07 16:09:18,754 INFO L226 Difference]: Without dead ends: 744 [2019-12-07 16:09:18,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:09:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-12-07 16:09:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 387. [2019-12-07 16:09:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-12-07 16:09:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 476 transitions. [2019-12-07 16:09:18,765 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 476 transitions. Word has length 58 [2019-12-07 16:09:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:18,765 INFO L462 AbstractCegarLoop]: Abstraction has 387 states and 476 transitions. [2019-12-07 16:09:18,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:09:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 476 transitions. [2019-12-07 16:09:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 16:09:18,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:18,766 INFO L410 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] [2019-12-07 16:09:18,766 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:18,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1081155419, now seen corresponding path program 1 times [2019-12-07 16:09:18,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:18,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899373465] [2019-12-07 16:09:18,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:20,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899373465] [2019-12-07 16:09:20,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:20,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:09:20,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982930705] [2019-12-07 16:09:20,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:09:20,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:20,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:09:20,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:09:20,560 INFO L87 Difference]: Start difference. First operand 387 states and 476 transitions. Second operand 9 states. [2019-12-07 16:09:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:23,948 INFO L93 Difference]: Finished difference Result 1267 states and 1564 transitions. [2019-12-07 16:09:23,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 16:09:23,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-07 16:09:23,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:23,952 INFO L225 Difference]: With dead ends: 1267 [2019-12-07 16:09:23,952 INFO L226 Difference]: Without dead ends: 906 [2019-12-07 16:09:23,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:09:23,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2019-12-07 16:09:23,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 405. [2019-12-07 16:09:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-07 16:09:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 483 transitions. [2019-12-07 16:09:23,963 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 483 transitions. Word has length 58 [2019-12-07 16:09:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:23,963 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 483 transitions. [2019-12-07 16:09:23,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:09:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 483 transitions. [2019-12-07 16:09:23,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 16:09:23,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:23,964 INFO L410 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] [2019-12-07 16:09:23,964 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:23,964 INFO L82 PathProgramCache]: Analyzing trace with hash 737384225, now seen corresponding path program 1 times [2019-12-07 16:09:23,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:23,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038100152] [2019-12-07 16:09:23,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:24,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038100152] [2019-12-07 16:09:24,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:24,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:09:24,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455613536] [2019-12-07 16:09:24,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:09:24,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:09:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:09:24,183 INFO L87 Difference]: Start difference. First operand 405 states and 483 transitions. Second operand 6 states. [2019-12-07 16:09:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:24,694 INFO L93 Difference]: Finished difference Result 929 states and 1084 transitions. [2019-12-07 16:09:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:09:24,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 16:09:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:24,696 INFO L225 Difference]: With dead ends: 929 [2019-12-07 16:09:24,696 INFO L226 Difference]: Without dead ends: 537 [2019-12-07 16:09:24,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:09:24,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-12-07 16:09:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 405. [2019-12-07 16:09:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-07 16:09:24,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 479 transitions. [2019-12-07 16:09:24,706 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 479 transitions. Word has length 62 [2019-12-07 16:09:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:24,706 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 479 transitions. [2019-12-07 16:09:24,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:09:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 479 transitions. [2019-12-07 16:09:24,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 16:09:24,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:24,706 INFO L410 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] [2019-12-07 16:09:24,707 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1757329030, now seen corresponding path program 1 times [2019-12-07 16:09:24,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:24,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987383563] [2019-12-07 16:09:24,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:24,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987383563] [2019-12-07 16:09:24,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:24,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:09:24,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613587891] [2019-12-07 16:09:24,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:09:24,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:09:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:09:24,822 INFO L87 Difference]: Start difference. First operand 405 states and 479 transitions. Second operand 4 states. [2019-12-07 16:09:25,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:25,041 INFO L93 Difference]: Finished difference Result 851 states and 1002 transitions. [2019-12-07 16:09:25,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:09:25,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-07 16:09:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:25,043 INFO L225 Difference]: With dead ends: 851 [2019-12-07 16:09:25,043 INFO L226 Difference]: Without dead ends: 447 [2019-12-07 16:09:25,044 INFO L630 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 [2019-12-07 16:09:25,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-12-07 16:09:25,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 405. [2019-12-07 16:09:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-12-07 16:09:25,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 467 transitions. [2019-12-07 16:09:25,052 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 467 transitions. Word has length 64 [2019-12-07 16:09:25,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:25,052 INFO L462 AbstractCegarLoop]: Abstraction has 405 states and 467 transitions. [2019-12-07 16:09:25,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:09:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 467 transitions. [2019-12-07 16:09:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 16:09:25,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:25,052 INFO L410 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] [2019-12-07 16:09:25,053 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:25,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash -225871924, now seen corresponding path program 1 times [2019-12-07 16:09:25,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:25,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677188671] [2019-12-07 16:09:25,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:27,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677188671] [2019-12-07 16:09:27,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:27,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 16:09:27,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147679367] [2019-12-07 16:09:27,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:09:27,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:27,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:09:27,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:09:27,601 INFO L87 Difference]: Start difference. First operand 405 states and 467 transitions. Second operand 10 states. [2019-12-07 16:09:33,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:33,657 INFO L93 Difference]: Finished difference Result 1455 states and 1662 transitions. [2019-12-07 16:09:33,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 16:09:33,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-07 16:09:33,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:33,661 INFO L225 Difference]: With dead ends: 1455 [2019-12-07 16:09:33,661 INFO L226 Difference]: Without dead ends: 1118 [2019-12-07 16:09:33,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2019-12-07 16:09:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-12-07 16:09:33,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 559. [2019-12-07 16:09:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-12-07 16:09:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 666 transitions. [2019-12-07 16:09:33,675 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 666 transitions. Word has length 64 [2019-12-07 16:09:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:33,675 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 666 transitions. [2019-12-07 16:09:33,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:09:33,675 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 666 transitions. [2019-12-07 16:09:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 16:09:33,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:33,676 INFO L410 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] [2019-12-07 16:09:33,676 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:33,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:33,676 INFO L82 PathProgramCache]: Analyzing trace with hash -944178150, now seen corresponding path program 1 times [2019-12-07 16:09:33,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:33,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971089159] [2019-12-07 16:09:33,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:34,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971089159] [2019-12-07 16:09:34,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:34,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 16:09:34,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049079833] [2019-12-07 16:09:34,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:09:34,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:34,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:09:34,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:09:34,487 INFO L87 Difference]: Start difference. First operand 559 states and 666 transitions. Second operand 10 states. [2019-12-07 16:09:42,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:42,874 INFO L93 Difference]: Finished difference Result 1476 states and 1717 transitions. [2019-12-07 16:09:42,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:09:42,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-07 16:09:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:42,879 INFO L225 Difference]: With dead ends: 1476 [2019-12-07 16:09:42,879 INFO L226 Difference]: Without dead ends: 1139 [2019-12-07 16:09:42,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:09:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-12-07 16:09:42,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 562. [2019-12-07 16:09:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-12-07 16:09:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 669 transitions. [2019-12-07 16:09:42,898 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 669 transitions. Word has length 65 [2019-12-07 16:09:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:42,898 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 669 transitions. [2019-12-07 16:09:42,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:09:42,898 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 669 transitions. [2019-12-07 16:09:42,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 16:09:42,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:42,899 INFO L410 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, 1, 1] [2019-12-07 16:09:42,899 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:42,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:42,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1357778399, now seen corresponding path program 1 times [2019-12-07 16:09:42,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:42,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046152897] [2019-12-07 16:09:42,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:43,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046152897] [2019-12-07 16:09:43,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:43,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 16:09:43,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743447602] [2019-12-07 16:09:43,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 16:09:43,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:43,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 16:09:43,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:09:43,464 INFO L87 Difference]: Start difference. First operand 562 states and 669 transitions. Second operand 14 states. [2019-12-07 16:09:52,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:09:52,171 INFO L93 Difference]: Finished difference Result 2559 states and 2965 transitions. [2019-12-07 16:09:52,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 16:09:52,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 70 [2019-12-07 16:09:52,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:09:52,178 INFO L225 Difference]: With dead ends: 2559 [2019-12-07 16:09:52,178 INFO L226 Difference]: Without dead ends: 2071 [2019-12-07 16:09:52,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=558, Invalid=1992, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 16:09:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2019-12-07 16:09:52,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 868. [2019-12-07 16:09:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-12-07 16:09:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1062 transitions. [2019-12-07 16:09:52,204 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1062 transitions. Word has length 70 [2019-12-07 16:09:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:09:52,204 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1062 transitions. [2019-12-07 16:09:52,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 16:09:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1062 transitions. [2019-12-07 16:09:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 16:09:52,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:09:52,205 INFO L410 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, 1, 1] [2019-12-07 16:09:52,205 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:09:52,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:09:52,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1430164957, now seen corresponding path program 1 times [2019-12-07 16:09:52,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:09:52,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128748636] [2019-12-07 16:09:52,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:09:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:09:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:09:54,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128748636] [2019-12-07 16:09:54,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:09:54,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 16:09:54,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972567820] [2019-12-07 16:09:54,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:09:54,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:09:54,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:09:54,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:09:54,791 INFO L87 Difference]: Start difference. First operand 868 states and 1062 transitions. Second operand 13 states. [2019-12-07 16:10:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:05,941 INFO L93 Difference]: Finished difference Result 2138 states and 2554 transitions. [2019-12-07 16:10:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 16:10:05,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 70 [2019-12-07 16:10:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:05,946 INFO L225 Difference]: With dead ends: 2138 [2019-12-07 16:10:05,946 INFO L226 Difference]: Without dead ends: 1576 [2019-12-07 16:10:05,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=283, Invalid=773, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 16:10:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-12-07 16:10:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 848. [2019-12-07 16:10:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-12-07 16:10:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1038 transitions. [2019-12-07 16:10:05,969 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1038 transitions. Word has length 70 [2019-12-07 16:10:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:05,970 INFO L462 AbstractCegarLoop]: Abstraction has 848 states and 1038 transitions. [2019-12-07 16:10:05,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:10:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1038 transitions. [2019-12-07 16:10:05,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:10:05,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:05,970 INFO L410 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, 1, 1, 1] [2019-12-07 16:10:05,971 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:05,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:05,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1338481899, now seen corresponding path program 1 times [2019-12-07 16:10:05,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:05,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660600440] [2019-12-07 16:10:05,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:06,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660600440] [2019-12-07 16:10:06,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:06,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 16:10:06,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920309707] [2019-12-07 16:10:06,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:10:06,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:06,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:10:06,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:10:06,657 INFO L87 Difference]: Start difference. First operand 848 states and 1038 transitions. Second operand 13 states. [2019-12-07 16:10:23,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:23,342 INFO L93 Difference]: Finished difference Result 2753 states and 3242 transitions. [2019-12-07 16:10:23,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-07 16:10:23,342 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 71 [2019-12-07 16:10:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:23,349 INFO L225 Difference]: With dead ends: 2753 [2019-12-07 16:10:23,349 INFO L226 Difference]: Without dead ends: 2189 [2019-12-07 16:10:23,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=732, Invalid=2574, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 16:10:23,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2019-12-07 16:10:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 1301. [2019-12-07 16:10:23,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-12-07 16:10:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1621 transitions. [2019-12-07 16:10:23,390 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1621 transitions. Word has length 71 [2019-12-07 16:10:23,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:23,390 INFO L462 AbstractCegarLoop]: Abstraction has 1301 states and 1621 transitions. [2019-12-07 16:10:23,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:10:23,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1621 transitions. [2019-12-07 16:10:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 16:10:23,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:23,391 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:23,391 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1163565004, now seen corresponding path program 1 times [2019-12-07 16:10:23,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:23,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328614838] [2019-12-07 16:10:23,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:26,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:26,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328614838] [2019-12-07 16:10:26,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:26,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:10:26,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259405748] [2019-12-07 16:10:26,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:10:26,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:26,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:10:26,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:10:26,980 INFO L87 Difference]: Start difference. First operand 1301 states and 1621 transitions. Second operand 6 states. [2019-12-07 16:10:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:30,116 INFO L93 Difference]: Finished difference Result 1532 states and 1883 transitions. [2019-12-07 16:10:30,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:10:30,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-12-07 16:10:30,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:30,121 INFO L225 Difference]: With dead ends: 1532 [2019-12-07 16:10:30,121 INFO L226 Difference]: Without dead ends: 1319 [2019-12-07 16:10:30,121 INFO L630 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 [2019-12-07 16:10:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-12-07 16:10:30,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1299. [2019-12-07 16:10:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2019-12-07 16:10:30,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1618 transitions. [2019-12-07 16:10:30,151 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1618 transitions. Word has length 76 [2019-12-07 16:10:30,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:30,152 INFO L462 AbstractCegarLoop]: Abstraction has 1299 states and 1618 transitions. [2019-12-07 16:10:30,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:10:30,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1618 transitions. [2019-12-07 16:10:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 16:10:30,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:30,153 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:30,153 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:30,153 INFO L82 PathProgramCache]: Analyzing trace with hash -527610616, now seen corresponding path program 1 times [2019-12-07 16:10:30,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:30,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987937503] [2019-12-07 16:10:30,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:33,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:33,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987937503] [2019-12-07 16:10:33,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:33,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:10:33,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163367641] [2019-12-07 16:10:33,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:10:33,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:33,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:10:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:10:33,357 INFO L87 Difference]: Start difference. First operand 1299 states and 1618 transitions. Second operand 7 states. [2019-12-07 16:10:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:36,662 INFO L93 Difference]: Finished difference Result 1525 states and 1875 transitions. [2019-12-07 16:10:36,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 16:10:36,662 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-12-07 16:10:36,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:36,667 INFO L225 Difference]: With dead ends: 1525 [2019-12-07 16:10:36,667 INFO L226 Difference]: Without dead ends: 1317 [2019-12-07 16:10:36,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:10:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-12-07 16:10:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1306. [2019-12-07 16:10:36,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-12-07 16:10:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1625 transitions. [2019-12-07 16:10:36,702 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1625 transitions. Word has length 76 [2019-12-07 16:10:36,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:36,702 INFO L462 AbstractCegarLoop]: Abstraction has 1306 states and 1625 transitions. [2019-12-07 16:10:36,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:10:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1625 transitions. [2019-12-07 16:10:36,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 16:10:36,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:36,703 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:36,703 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:36,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:36,703 INFO L82 PathProgramCache]: Analyzing trace with hash -682948336, now seen corresponding path program 1 times [2019-12-07 16:10:36,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:36,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211590713] [2019-12-07 16:10:36,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:39,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211590713] [2019-12-07 16:10:39,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:39,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:10:39,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106295764] [2019-12-07 16:10:39,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:10:39,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:39,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:10:39,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:10:39,064 INFO L87 Difference]: Start difference. First operand 1306 states and 1625 transitions. Second operand 7 states. [2019-12-07 16:10:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:42,332 INFO L93 Difference]: Finished difference Result 1526 states and 1874 transitions. [2019-12-07 16:10:42,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:10:42,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-12-07 16:10:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:42,337 INFO L225 Difference]: With dead ends: 1526 [2019-12-07 16:10:42,337 INFO L226 Difference]: Without dead ends: 1317 [2019-12-07 16:10:42,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:10:42,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2019-12-07 16:10:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1306. [2019-12-07 16:10:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-12-07 16:10:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1624 transitions. [2019-12-07 16:10:42,366 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1624 transitions. Word has length 76 [2019-12-07 16:10:42,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:42,366 INFO L462 AbstractCegarLoop]: Abstraction has 1306 states and 1624 transitions. [2019-12-07 16:10:42,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:10:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1624 transitions. [2019-12-07 16:10:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 16:10:42,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:42,367 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:42,367 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:42,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:42,367 INFO L82 PathProgramCache]: Analyzing trace with hash -424782898, now seen corresponding path program 1 times [2019-12-07 16:10:42,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:42,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810624464] [2019-12-07 16:10:42,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:42,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810624464] [2019-12-07 16:10:42,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:42,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:10:42,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914477317] [2019-12-07 16:10:42,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:10:42,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:42,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:10:42,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:10:42,635 INFO L87 Difference]: Start difference. First operand 1306 states and 1624 transitions. Second operand 6 states. [2019-12-07 16:10:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:45,835 INFO L93 Difference]: Finished difference Result 1722 states and 2097 transitions. [2019-12-07 16:10:45,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:10:45,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 76 [2019-12-07 16:10:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:45,840 INFO L225 Difference]: With dead ends: 1722 [2019-12-07 16:10:45,840 INFO L226 Difference]: Without dead ends: 1511 [2019-12-07 16:10:45,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:10:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2019-12-07 16:10:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1303. [2019-12-07 16:10:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1303 states. [2019-12-07 16:10:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1620 transitions. [2019-12-07 16:10:45,870 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1620 transitions. Word has length 76 [2019-12-07 16:10:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:45,870 INFO L462 AbstractCegarLoop]: Abstraction has 1303 states and 1620 transitions. [2019-12-07 16:10:45,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:10:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1620 transitions. [2019-12-07 16:10:45,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 16:10:45,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:45,871 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:45,871 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:45,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:45,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2115958518, now seen corresponding path program 1 times [2019-12-07 16:10:45,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:45,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153028081] [2019-12-07 16:10:45,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:46,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153028081] [2019-12-07 16:10:46,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:46,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:10:46,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590870335] [2019-12-07 16:10:46,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:10:46,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:46,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:10:46,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:10:46,146 INFO L87 Difference]: Start difference. First operand 1303 states and 1620 transitions. Second operand 7 states. [2019-12-07 16:10:49,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:49,701 INFO L93 Difference]: Finished difference Result 1720 states and 2094 transitions. [2019-12-07 16:10:49,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:10:49,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-12-07 16:10:49,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:49,706 INFO L225 Difference]: With dead ends: 1720 [2019-12-07 16:10:49,706 INFO L226 Difference]: Without dead ends: 1514 [2019-12-07 16:10:49,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:10:49,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2019-12-07 16:10:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1301. [2019-12-07 16:10:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2019-12-07 16:10:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1617 transitions. [2019-12-07 16:10:49,736 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1617 transitions. Word has length 76 [2019-12-07 16:10:49,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:49,737 INFO L462 AbstractCegarLoop]: Abstraction has 1301 states and 1617 transitions. [2019-12-07 16:10:49,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:10:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1617 transitions. [2019-12-07 16:10:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 16:10:49,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:49,738 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:49,738 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1435900148, now seen corresponding path program 1 times [2019-12-07 16:10:49,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:49,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108393902] [2019-12-07 16:10:49,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:49,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108393902] [2019-12-07 16:10:49,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:49,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:10:49,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670706652] [2019-12-07 16:10:49,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:10:49,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:49,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:10:49,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:10:49,963 INFO L87 Difference]: Start difference. First operand 1301 states and 1617 transitions. Second operand 5 states. [2019-12-07 16:10:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:10:53,224 INFO L93 Difference]: Finished difference Result 2598 states and 3301 transitions. [2019-12-07 16:10:53,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:10:53,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-07 16:10:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:10:53,230 INFO L225 Difference]: With dead ends: 2598 [2019-12-07 16:10:53,230 INFO L226 Difference]: Without dead ends: 1812 [2019-12-07 16:10:53,230 INFO L630 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 [2019-12-07 16:10:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2019-12-07 16:10:53,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1294. [2019-12-07 16:10:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2019-12-07 16:10:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1588 transitions. [2019-12-07 16:10:53,262 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1588 transitions. Word has length 76 [2019-12-07 16:10:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:10:53,262 INFO L462 AbstractCegarLoop]: Abstraction has 1294 states and 1588 transitions. [2019-12-07 16:10:53,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:10:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1588 transitions. [2019-12-07 16:10:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 16:10:53,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:10:53,263 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:10:53,263 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:10:53,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:10:53,263 INFO L82 PathProgramCache]: Analyzing trace with hash 80086497, now seen corresponding path program 1 times [2019-12-07 16:10:53,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:10:53,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693909893] [2019-12-07 16:10:53,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:10:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:10:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:10:56,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693909893] [2019-12-07 16:10:56,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:10:56,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 16:10:56,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722884229] [2019-12-07 16:10:56,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 16:10:56,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:10:56,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 16:10:56,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:10:56,064 INFO L87 Difference]: Start difference. First operand 1294 states and 1588 transitions. Second operand 18 states. [2019-12-07 16:11:05,767 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-07 16:11:06,413 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-12-07 16:11:07,146 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-12-07 16:11:08,144 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-07 16:11:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:11:12,410 INFO L93 Difference]: Finished difference Result 3256 states and 3893 transitions. [2019-12-07 16:11:12,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-07 16:11:12,410 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2019-12-07 16:11:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:11:12,420 INFO L225 Difference]: With dead ends: 3256 [2019-12-07 16:11:12,420 INFO L226 Difference]: Without dead ends: 3209 [2019-12-07 16:11:12,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2680 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1336, Invalid=7406, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 16:11:12,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2019-12-07 16:11:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 1502. [2019-12-07 16:11:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2019-12-07 16:11:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1836 transitions. [2019-12-07 16:11:12,467 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1836 transitions. Word has length 78 [2019-12-07 16:11:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:11:12,467 INFO L462 AbstractCegarLoop]: Abstraction has 1502 states and 1836 transitions. [2019-12-07 16:11:12,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 16:11:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1836 transitions. [2019-12-07 16:11:12,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 16:11:12,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:11:12,468 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:11:12,468 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:11:12,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:11:12,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1608857245, now seen corresponding path program 1 times [2019-12-07 16:11:12,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:11:12,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806847399] [2019-12-07 16:11:12,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:11:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:11:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:11:12,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806847399] [2019-12-07 16:11:12,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:11:12,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 16:11:12,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76158356] [2019-12-07 16:11:12,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:11:12,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:11:12,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:11:12,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:11:12,830 INFO L87 Difference]: Start difference. First operand 1502 states and 1836 transitions. Second operand 8 states. [2019-12-07 16:11:17,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:11:17,091 INFO L93 Difference]: Finished difference Result 2161 states and 2542 transitions. [2019-12-07 16:11:17,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:11:17,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-07 16:11:17,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:11:17,098 INFO L225 Difference]: With dead ends: 2161 [2019-12-07 16:11:17,098 INFO L226 Difference]: Without dead ends: 1948 [2019-12-07 16:11:17,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 16:11:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-12-07 16:11:17,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1510. [2019-12-07 16:11:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1510 states. [2019-12-07 16:11:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1510 states to 1510 states and 1844 transitions. [2019-12-07 16:11:17,139 INFO L78 Accepts]: Start accepts. Automaton has 1510 states and 1844 transitions. Word has length 78 [2019-12-07 16:11:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:11:17,140 INFO L462 AbstractCegarLoop]: Abstraction has 1510 states and 1844 transitions. [2019-12-07 16:11:17,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:11:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1510 states and 1844 transitions. [2019-12-07 16:11:17,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 16:11:17,141 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:11:17,141 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:11:17,141 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:11:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:11:17,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1628839663, now seen corresponding path program 1 times [2019-12-07 16:11:17,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:11:17,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353992445] [2019-12-07 16:11:17,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:11:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:11:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:11:17,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353992445] [2019-12-07 16:11:17,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:11:17,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 16:11:17,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764326865] [2019-12-07 16:11:17,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 16:11:17,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:11:17,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 16:11:17,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:11:17,699 INFO L87 Difference]: Start difference. First operand 1510 states and 1844 transitions. Second operand 13 states. [2019-12-07 16:11:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:11:32,737 INFO L93 Difference]: Finished difference Result 2673 states and 3132 transitions. [2019-12-07 16:11:32,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:11:32,738 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2019-12-07 16:11:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:11:32,743 INFO L225 Difference]: With dead ends: 2673 [2019-12-07 16:11:32,743 INFO L226 Difference]: Without dead ends: 2064 [2019-12-07 16:11:32,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:11:32,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2019-12-07 16:11:32,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 1498. [2019-12-07 16:11:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2019-12-07 16:11:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1828 transitions. [2019-12-07 16:11:32,808 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1828 transitions. Word has length 79 [2019-12-07 16:11:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:11:32,808 INFO L462 AbstractCegarLoop]: Abstraction has 1498 states and 1828 transitions. [2019-12-07 16:11:32,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 16:11:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1828 transitions. [2019-12-07 16:11:32,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 16:11:32,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:11:32,809 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:11:32,809 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:11:32,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:11:32,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1690879277, now seen corresponding path program 1 times [2019-12-07 16:11:32,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:11:32,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989259993] [2019-12-07 16:11:32,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:11:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:11:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:11:39,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989259993] [2019-12-07 16:11:39,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:11:39,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 16:11:39,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176707912] [2019-12-07 16:11:39,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 16:11:39,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:11:39,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 16:11:39,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:11:39,016 INFO L87 Difference]: Start difference. First operand 1498 states and 1828 transitions. Second operand 19 states. [2019-12-07 16:11:53,779 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2019-12-07 16:11:54,065 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-12-07 16:11:54,598 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-12-07 16:11:55,037 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-07 16:11:55,856 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-12-07 16:12:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:12:02,796 INFO L93 Difference]: Finished difference Result 3074 states and 3621 transitions. [2019-12-07 16:12:02,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-12-07 16:12:02,796 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 79 [2019-12-07 16:12:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:12:02,799 INFO L225 Difference]: With dead ends: 3074 [2019-12-07 16:12:02,799 INFO L226 Difference]: Without dead ends: 3068 [2019-12-07 16:12:02,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4126 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1891, Invalid=10991, Unknown=0, NotChecked=0, Total=12882 [2019-12-07 16:12:02,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2019-12-07 16:12:02,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 1427. [2019-12-07 16:12:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1427 states. [2019-12-07 16:12:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1731 transitions. [2019-12-07 16:12:02,845 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1731 transitions. Word has length 79 [2019-12-07 16:12:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:12:02,845 INFO L462 AbstractCegarLoop]: Abstraction has 1427 states and 1731 transitions. [2019-12-07 16:12:02,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 16:12:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1731 transitions. [2019-12-07 16:12:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 16:12:02,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:12:02,846 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:12:02,846 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:12:02,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:12:02,846 INFO L82 PathProgramCache]: Analyzing trace with hash -538632851, now seen corresponding path program 1 times [2019-12-07 16:12:02,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:12:02,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136735251] [2019-12-07 16:12:02,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:12:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:12:02,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:12:02,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136735251] [2019-12-07 16:12:02,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:12:02,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:12:02,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231159743] [2019-12-07 16:12:02,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:12:02,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:12:02,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:12:02,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:12:02,981 INFO L87 Difference]: Start difference. First operand 1427 states and 1731 transitions. Second operand 3 states. [2019-12-07 16:12:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:12:03,020 INFO L93 Difference]: Finished difference Result 2545 states and 3105 transitions. [2019-12-07 16:12:03,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:12:03,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-07 16:12:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:12:03,023 INFO L225 Difference]: With dead ends: 2545 [2019-12-07 16:12:03,023 INFO L226 Difference]: Without dead ends: 1562 [2019-12-07 16:12:03,024 INFO L630 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 [2019-12-07 16:12:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-12-07 16:12:03,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1427. [2019-12-07 16:12:03,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1427 states. [2019-12-07 16:12:03,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1723 transitions. [2019-12-07 16:12:03,061 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1723 transitions. Word has length 81 [2019-12-07 16:12:03,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:12:03,061 INFO L462 AbstractCegarLoop]: Abstraction has 1427 states and 1723 transitions. [2019-12-07 16:12:03,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:12:03,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1723 transitions. [2019-12-07 16:12:03,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 16:12:03,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:12:03,062 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:12:03,062 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:12:03,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:12:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1565934267, now seen corresponding path program 1 times [2019-12-07 16:12:03,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:12:03,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385308635] [2019-12-07 16:12:03,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:12:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:12:04,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:12:04,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385308635] [2019-12-07 16:12:04,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:12:04,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:12:04,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312212979] [2019-12-07 16:12:04,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:12:04,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:12:04,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:12:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:12:04,745 INFO L87 Difference]: Start difference. First operand 1427 states and 1723 transitions. Second operand 9 states. [2019-12-07 16:12:08,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:12:08,888 INFO L93 Difference]: Finished difference Result 3176 states and 3735 transitions. [2019-12-07 16:12:08,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 16:12:08,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2019-12-07 16:12:08,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:12:08,892 INFO L225 Difference]: With dead ends: 3176 [2019-12-07 16:12:08,892 INFO L226 Difference]: Without dead ends: 2506 [2019-12-07 16:12:08,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2019-12-07 16:12:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-12-07 16:12:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1423. [2019-12-07 16:12:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-12-07 16:12:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1718 transitions. [2019-12-07 16:12:08,943 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1718 transitions. Word has length 81 [2019-12-07 16:12:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:12:08,943 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 1718 transitions. [2019-12-07 16:12:08,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:12:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1718 transitions. [2019-12-07 16:12:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 16:12:08,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:12:08,944 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:12:08,944 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:12:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:12:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1544878805, now seen corresponding path program 1 times [2019-12-07 16:12:08,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:12:08,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316940386] [2019-12-07 16:12:08,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:12:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:12:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:12:09,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316940386] [2019-12-07 16:12:09,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:12:09,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:12:09,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713246290] [2019-12-07 16:12:09,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:12:09,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:12:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:12:09,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:12:09,176 INFO L87 Difference]: Start difference. First operand 1423 states and 1718 transitions. Second operand 3 states. [2019-12-07 16:12:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:12:09,205 INFO L93 Difference]: Finished difference Result 1633 states and 1952 transitions. [2019-12-07 16:12:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:12:09,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-07 16:12:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:12:09,206 INFO L225 Difference]: With dead ends: 1633 [2019-12-07 16:12:09,206 INFO L226 Difference]: Without dead ends: 650 [2019-12-07 16:12:09,207 INFO L630 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 [2019-12-07 16:12:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-12-07 16:12:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 511. [2019-12-07 16:12:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-12-07 16:12:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 567 transitions. [2019-12-07 16:12:09,221 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 567 transitions. Word has length 82 [2019-12-07 16:12:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:12:09,221 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 567 transitions. [2019-12-07 16:12:09,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:12:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 567 transitions. [2019-12-07 16:12:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 16:12:09,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:12:09,222 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:12:09,222 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:12:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:12:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash 2126968051, now seen corresponding path program 1 times [2019-12-07 16:12:09,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:12:09,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515678741] [2019-12-07 16:12:09,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:12:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:12:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:12:09,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515678741] [2019-12-07 16:12:09,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6324595] [2019-12-07 16:12:09,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:12:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:12:18,784 INFO L264 TraceCheckSpWp]: Trace formula consists of 2974 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-07 16:12:18,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:12:18,833 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 16:12:18,833 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:12:18,838 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:12:18,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 16:12:18,839 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-12-07 16:12:18,935 INFO L430 ElimStorePlain]: Different costs {4=[|v_#memory_int_109|], 10=[|v_#memory_int_110|]} [2019-12-07 16:12:18,941 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:12:18,963 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:12:18,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:12:19,006 INFO L343 Elim1Store]: treesize reduction 175, result has 12.9 percent of original size [2019-12-07 16:12:19,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 47 [2019-12-07 16:12:19,007 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:12:19,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:12:19,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:12:19,021 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:43 [2019-12-07 16:12:19,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:12:19,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:12:19,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 118 [2019-12-07 16:12:19,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:12:19,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:12:19,301 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:12:19,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 119 [2019-12-07 16:12:19,302 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:12:19,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:12:19,364 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:12:19,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 124 [2019-12-07 16:12:19,365 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:12:19,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:12:19,413 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:12:19,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 16:12:19,414 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:12:19,697 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-12-07 16:12:19,698 INFO L614 ElimStorePlain]: treesize reduction 172, result has 66.6 percent of original size [2019-12-07 16:12:19,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,711 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2019-12-07 16:12:19,712 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:283, output treesize:343 [2019-12-07 16:12:19,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:19,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:28,258 WARN L192 SmtUtils]: Spent 8.46 s on a formula simplification. DAG size of input: 135 DAG size of output: 72 [2019-12-07 16:12:28,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:28,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:28,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:28,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:28,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:28,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:30,616 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 16:12:30,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:30,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:30,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:30,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:30,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:30,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:44,910 WARN L192 SmtUtils]: Spent 3.13 s on a formula simplification that was a NOOP. DAG size: 139 [2019-12-07 16:12:45,241 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-07 16:12:45,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 16:12:45,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:45,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:45,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:45,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:45,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:45,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:12:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:12:45,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 16:12:45,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 16] total 19 [2019-12-07 16:12:45,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902832083] [2019-12-07 16:12:45,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 16:12:45,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:12:45,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 16:12:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=293, Unknown=3, NotChecked=0, Total=342 [2019-12-07 16:12:45,461 INFO L87 Difference]: Start difference. First operand 511 states and 567 transitions. Second operand 19 states. [2019-12-07 16:13:46,041 WARN L192 SmtUtils]: Spent 2.27 s on a formula simplification that was a NOOP. DAG size: 100 [2019-12-07 16:13:48,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:48,627 INFO L93 Difference]: Finished difference Result 1032 states and 1141 transitions. [2019-12-07 16:13:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 16:13:48,627 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-12-07 16:13:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:48,628 INFO L225 Difference]: With dead ends: 1032 [2019-12-07 16:13:48,628 INFO L226 Difference]: Without dead ends: 824 [2019-12-07 16:13:48,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 41.5s TimeCoverageRelationStatistics Valid=363, Invalid=2081, Unknown=6, NotChecked=0, Total=2450 [2019-12-07 16:13:48,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-07 16:13:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 513. [2019-12-07 16:13:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-12-07 16:13:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 569 transitions. [2019-12-07 16:13:48,648 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 569 transitions. Word has length 84 [2019-12-07 16:13:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:13:48,648 INFO L462 AbstractCegarLoop]: Abstraction has 513 states and 569 transitions. [2019-12-07 16:13:48,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 16:13:48,648 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 569 transitions. [2019-12-07 16:13:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 16:13:48,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:48,649 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:13:48,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:13:48,850 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:13:48,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:48,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1125982319, now seen corresponding path program 2 times [2019-12-07 16:13:48,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:13:48,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294112579] [2019-12-07 16:13:48,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:13:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:13:49,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294112579] [2019-12-07 16:13:49,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632083925] [2019-12-07 16:13:49,190 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:05,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 16:16:05,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 16:16:05,531 INFO L264 TraceCheckSpWp]: Trace formula consists of 2981 conjuncts, 80 conjunts are in the unsatisfiable core [2019-12-07 16:16:05,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:16:05,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 16:16:05,546 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:05,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 16:16:05,551 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:05,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:05,569 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 16:16:05,569 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2019-12-07 16:16:05,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:05,666 INFO L430 ElimStorePlain]: Different costs {4=[|v_#memory_int_112|], 10=[|v_#memory_int_113|]} [2019-12-07 16:16:05,668 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:16:05,682 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:05,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:05,719 INFO L343 Elim1Store]: treesize reduction 175, result has 12.9 percent of original size [2019-12-07 16:16:05,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 47 [2019-12-07 16:16:05,719 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:05,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:05,732 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 16:16:05,732 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:43 [2019-12-07 16:16:05,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:05,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:05,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:05,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:05,947 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:05,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 124 [2019-12-07 16:16:05,948 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:05,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:06,003 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:06,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 113 [2019-12-07 16:16:06,004 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:06,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:06,063 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:06,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 119 [2019-12-07 16:16:06,064 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:06,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:06,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:06,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 118 [2019-12-07 16:16:06,113 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:06,425 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-12-07 16:16:06,425 INFO L614 ElimStorePlain]: treesize reduction 172, result has 66.6 percent of original size [2019-12-07 16:16:06,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,433 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-12-07 16:16:06,433 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:283, output treesize:343 [2019-12-07 16:16:06,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,805 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-12-07 16:16:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 16:16:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:06,976 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:06,976 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:07,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:07,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:07,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:09,722 INFO L237 Elim1Store]: Index analysis took 2586 ms [2019-12-07 16:16:11,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 69 [2019-12-07 16:16:11,107 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:11,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:16,886 INFO L237 Elim1Store]: Index analysis took 5497 ms [2019-12-07 16:16:18,369 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:18,369 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 216 [2019-12-07 16:16:18,370 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:18,377 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:18,377 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:18,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:19,141 INFO L237 Elim1Store]: Index analysis took 718 ms [2019-12-07 16:16:19,363 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:19,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 138 [2019-12-07 16:16:19,364 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:19,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:19,694 INFO L237 Elim1Store]: Index analysis took 310 ms [2019-12-07 16:16:19,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:19,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 193 [2019-12-07 16:16:19,858 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:19,866 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:19,866 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:19,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:20,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:20,628 INFO L237 Elim1Store]: Index analysis took 658 ms [2019-12-07 16:16:20,857 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:20,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 94 [2019-12-07 16:16:20,858 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:20,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:21,308 INFO L237 Elim1Store]: Index analysis took 404 ms [2019-12-07 16:16:21,541 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:21,542 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 144 [2019-12-07 16:16:21,542 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:21,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:21,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:22,325 INFO L237 Elim1Store]: Index analysis took 711 ms [2019-12-07 16:16:22,623 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:22,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 112 [2019-12-07 16:16:22,624 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:22,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:24,036 INFO L237 Elim1Store]: Index analysis took 1321 ms [2019-12-07 16:16:24,632 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:24,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 206 [2019-12-07 16:16:24,633 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:24,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:24,801 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:24,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 138 [2019-12-07 16:16:24,802 INFO L534 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:24,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:24,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:24,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:25,206 INFO L237 Elim1Store]: Index analysis took 370 ms [2019-12-07 16:16:25,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 63 [2019-12-07 16:16:25,402 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:25,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:26,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:28,301 INFO L237 Elim1Store]: Index analysis took 2735 ms [2019-12-07 16:16:29,284 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:29,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 168 [2019-12-07 16:16:29,285 INFO L534 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:29,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:29,804 INFO L237 Elim1Store]: Index analysis took 494 ms [2019-12-07 16:16:29,953 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:29,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 151 [2019-12-07 16:16:29,954 INFO L534 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:29,967 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:29,967 INFO L534 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:29,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:30,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:30,092 INFO L237 Elim1Store]: Index analysis took 105 ms [2019-12-07 16:16:30,169 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:30,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 158 [2019-12-07 16:16:30,170 INFO L534 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:30,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:30,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:30,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:30,404 INFO L237 Elim1Store]: Index analysis took 181 ms [2019-12-07 16:16:30,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2019-12-07 16:16:30,498 INFO L534 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:30,514 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:30,514 INFO L534 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:30,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:30,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:30,667 INFO L237 Elim1Store]: Index analysis took 131 ms [2019-12-07 16:16:30,758 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:30,758 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 160 [2019-12-07 16:16:30,759 INFO L534 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:30,769 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:30,769 INFO L534 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:30,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:30,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:30,891 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:30,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 107 [2019-12-07 16:16:30,891 INFO L534 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:30,902 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:30,902 INFO L534 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:30,913 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:30,913 INFO L534 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:30,925 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:30,925 INFO L534 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:30,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:31,149 INFO L237 Elim1Store]: Index analysis took 193 ms [2019-12-07 16:16:31,269 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:31,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 203 [2019-12-07 16:16:31,270 INFO L534 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:31,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,005 INFO L237 Elim1Store]: Index analysis took 652 ms [2019-12-07 16:16:32,246 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:32,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 160 [2019-12-07 16:16:32,247 INFO L534 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:32,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,353 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:32,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 140 [2019-12-07 16:16:32,354 INFO L534 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:32,366 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:32,366 INFO L534 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:32,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,389 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 56 [2019-12-07 16:16:32,414 INFO L534 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:32,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:32,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 107 [2019-12-07 16:16:32,583 INFO L534 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:32,594 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:32,594 INFO L534 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:32,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,680 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:32,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 140 [2019-12-07 16:16:32,681 INFO L534 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:32,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:32,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 166 [2019-12-07 16:16:32,808 INFO L534 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:32,819 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 16:16:32,819 INFO L534 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:32,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 16:16:32,891 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 16:16:32,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 153 [2019-12-07 16:16:32,892 INFO L534 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2019-12-07 16:16:36,524 WARN L192 SmtUtils]: Spent 3.63 s on a formula simplification. DAG size of input: 347 DAG size of output: 224 [2019-12-07 16:16:36,525 INFO L614 ElimStorePlain]: treesize reduction 1523, result has 60.0 percent of original size [2019-12-07 16:16:36,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 128 dim-0 vars, and 24 xjuncts. [2019-12-07 16:16:36,551 INFO L239 ElimStorePlain]: Needed 37 recursive calls to eliminate 13 variables, input treesize:3145, output treesize:2287 [2019-12-07 16:16:36,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:36,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 16:16:45,132 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. [2019-12-07 16:16:45,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:16:45,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-12-07 16:16:45,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618366667] [2019-12-07 16:16:45,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:16:45,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:16:45,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:16:45,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-07 16:16:45,133 INFO L87 Difference]: Start difference. First operand 513 states and 569 transitions. Second operand 6 states. [2019-12-07 16:16:45,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:16:45,340 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:100) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertCodeBlock(IncrementalHoareTripleChecker.java:430) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:161) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:714) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 31 more [2019-12-07 16:16:45,346 INFO L168 Benchmark]: Toolchain (without parser) took 472994.99 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 703.1 MB). Free memory was 927.2 MB in the beginning and 1.5 GB in the end (delta: -579.8 MB). Peak memory consumption was 123.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:45,346 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:16:45,346 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2096.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 927.2 MB in the beginning and 861.1 MB in the end (delta: 66.1 MB). Peak memory consumption was 216.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:45,347 INFO L168 Benchmark]: Boogie Procedure Inliner took 121.86 ms. Allocated memory is still 1.1 GB. Free memory was 861.1 MB in the beginning and 845.6 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:45,347 INFO L168 Benchmark]: Boogie Preprocessor took 75.53 ms. Allocated memory is still 1.1 GB. Free memory was 845.6 MB in the beginning and 835.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:45,348 INFO L168 Benchmark]: RCFGBuilder took 7185.36 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 477.1 MB). Free memory was 835.3 MB in the beginning and 1.3 GB in the end (delta: -467.0 MB). Peak memory consumption was 542.1 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:45,348 INFO L168 Benchmark]: TraceAbstraction took 463512.32 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 130.5 MB). Free memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: -204.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:16:45,352 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2096.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 927.2 MB in the beginning and 861.1 MB in the end (delta: 66.1 MB). Peak memory consumption was 216.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 121.86 ms. Allocated memory is still 1.1 GB. Free memory was 861.1 MB in the beginning and 845.6 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.53 ms. Allocated memory is still 1.1 GB. Free memory was 845.6 MB in the beginning and 835.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 7185.36 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 477.1 MB). Free memory was 835.3 MB in the beginning and 1.3 GB in the end (delta: -467.0 MB). Peak memory consumption was 542.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 463512.32 ms. Allocated memory was 1.6 GB in the beginning and 1.7 GB in the end (delta: 130.5 MB). Free memory was 1.3 GB in the beginning and 1.5 GB in the end (delta: -204.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 16:16:46,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:16:46,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:16:46,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:16:46,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:16:46,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:16:46,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:16:46,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:16:46,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:16:46,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:16:46,543 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:16:46,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:16:46,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:16:46,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:16:46,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:16:46,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:16:46,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:16:46,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:16:46,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:16:46,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:16:46,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:16:46,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:16:46,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:16:46,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:16:46,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:16:46,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:16:46,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:16:46,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:16:46,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:16:46,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:16:46,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:16:46,558 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:16:46,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:16:46,559 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:16:46,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:16:46,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:16:46,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:16:46,561 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:16:46,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:16:46,561 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:16:46,562 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:16:46,562 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-12-07 16:16:46,572 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:16:46,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:16:46,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:16:46,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:16:46,573 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:16:46,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:16:46,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:16:46,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:16:46,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:16:46,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:16:46,574 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 16:16:46,574 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 16:16:46,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:16:46,575 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:16:46,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:16:46,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:16:46,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:16:46,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:16:46,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:16:46,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:16:46,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:16:46,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:16:46,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:16:46,576 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 16:16:46,576 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 16:16:46,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:16:46,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:16:46,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:16:46,577 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-12-07 16:16:46,577 INFO L138 SettingsManager]: * To the following directory=dump/ 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer 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(__VERIFIER_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 -> d06f524697fe97ff48c3d006beaa8ce1b592c7dd [2019-12-07 16:16:46,754 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:16:46,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:16:46,766 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:16:46,768 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:16:46,768 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:16:46,769 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/../../sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2019-12-07 16:16:46,816 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data/7c7206420/59f8795529744b1c9349fba4d7863478/FLAG068993bfc [2019-12-07 16:16:47,467 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:16:47,467 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/sv-benchmarks/c/aws-c-common/aws_byte_buf_advance_harness.i [2019-12-07 16:16:47,489 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data/7c7206420/59f8795529744b1c9349fba4d7863478/FLAG068993bfc [2019-12-07 16:16:47,819 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_98b7114d-84b2-48d2-bd31-6726012bff3e/bin/uautomizer/data/7c7206420/59f8795529744b1c9349fba4d7863478 [2019-12-07 16:16:47,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:16:47,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:16:47,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:16:47,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:16:47,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:16:47,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:16:47" (1/1) ... [2019-12-07 16:16:47,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b29636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:47, skipping insertion in model container [2019-12-07 16:16:47,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:16:47" (1/1) ... [2019-12-07 16:16:47,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:16:47,957 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:16:48,191 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2019-12-07 16:16:48,195 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2019-12-07 16:16:48,807 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,807 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,808 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,808 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,809 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,819 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,820 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,821 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,822 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,823 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,824 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,824 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:48,825 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,134 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2019-12-07 16:16:49,135 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2019-12-07 16:16:49,135 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2019-12-07 16:16:49,136 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2019-12-07 16:16:49,137 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2019-12-07 16:16:49,138 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2019-12-07 16:16:49,138 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2019-12-07 16:16:49,139 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2019-12-07 16:16:49,139 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2019-12-07 16:16:49,140 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2019-12-07 16:16:49,265 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2019-12-07 16:16:49,328 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,328 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:16:49,412 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:16:49,422 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2019-12-07 16:16:49,422 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow [2019-12-07 16:16:49,446 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,446 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,447 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,447 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,448 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,452 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,453 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,453 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,454 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,454 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,455 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,455 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,455 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,479 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2019-12-07 16:16:49,479 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2019-12-07 16:16:49,480 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2019-12-07 16:16:49,480 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2019-12-07 16:16:49,481 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2019-12-07 16:16:49,481 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2019-12-07 16:16:49,481 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2019-12-07 16:16:49,482 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2019-12-07 16:16:49,482 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2019-12-07 16:16:49,482 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2019-12-07 16:16:49,496 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy [2019-12-07 16:16:49,540 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,540 WARN L1484 CHandler]: Possible shadowing of function index [2019-12-07 16:16:49,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:16:50,185 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:16:50,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:50 WrapperNode [2019-12-07 16:16:50,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:16:50,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:16:50,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:16:50,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:16:50,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:50" (1/1) ... [2019-12-07 16:16:50,234 ERROR L1131 TypeChecker]: C: unsigned long nondet_size_t() { return __VERIFIER_nondet_ulong(); } [258]: Type differs at parameter #res in Procedure[nondet_size_t,[],[],[VarList[C: unsigned long nondet_size_t() { return __VERIFIER_nondet_ulong(); } [258],[#res],NamedType[C_ULONG,[]],null]],null,Body[C: unsigned long nondet_size_t() { return __VERIFIER_nondet_ulong(); } [258],[VariableDeclaration[[VarList[C: __VERIFIER_nondet_ulong() [258],[#t~nondet6],NamedType[C_ULONG,[]],null]]]],[AssignmentStatement[[VariableLHS[#res,]],[IdentifierExpression[#t~nondet6,]]],HavocStatement[[VariableLHS[#t~nondet6,]]],ReturnStatement]]] [2019-12-07 16:16:50,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:16:50" (1/1) ... [2019-12-07 16:16:50,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:16:50,257 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 16:16:50,259 INFO L168 Benchmark]: Toolchain (without parser) took 2431.46 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 941.6 MB in the beginning and 1.0 GB in the end (delta: -63.8 MB). Peak memory consumption was 160.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:50,259 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:16:50,259 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2356.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 941.6 MB in the beginning and 1.0 GB in the end (delta: -72.0 MB). Peak memory consumption was 296.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:50,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.79 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:16:50,261 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 2356.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.4 MB). Free memory was 941.6 MB in the beginning and 1.0 GB in the end (delta: -72.0 MB). Peak memory consumption was 296.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.79 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - TypeErrorResult [Line: 258]: Type Error Type differs at parameter #res in Procedure[nondet_size_t,[],[],[VarList[C: unsigned long nondet_size_t() { return __VERIFIER_nondet_ulong(); } [258],[#res],NamedType[C_ULONG,[]],null]],null,Body[C: unsigned long nondet_size_t() { return __VERIFIER_nondet_ulong(); } [258],[VariableDeclaration[[VarList[C: __VERIFIER_nondet_ulong() [258],[#t~nondet6],NamedType[C_ULONG,[]],null]]]],[AssignmentStatement[[VariableLHS[#res,]],[IdentifierExpression[#t~nondet6,]]],HavocStatement[[VariableLHS[#t~nondet6,]]],ReturnStatement]]] RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...