./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label07.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f428802ac72f1d2a0fe821ea4740cdcba55def6a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label07.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f428802ac72f1d2a0fe821ea4740cdcba55def6a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 06:51:59,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:51:59,025 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:51:59,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:51:59,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:51:59,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:51:59,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:51:59,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:51:59,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:51:59,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:51:59,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:51:59,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:51:59,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:51:59,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:51:59,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:51:59,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:51:59,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:51:59,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:51:59,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:51:59,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:51:59,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:51:59,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:51:59,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:51:59,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:51:59,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:51:59,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:51:59,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:51:59,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:51:59,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:51:59,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:51:59,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:51:59,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:51:59,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:51:59,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:51:59,105 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:51:59,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:51:59,106 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:51:59,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:51:59,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:51:59,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:51:59,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:51:59,108 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 06:51:59,130 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:51:59,130 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:51:59,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:51:59,131 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:51:59,131 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:51:59,131 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:51:59,131 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 06:51:59,132 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:51:59,132 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:51:59,132 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 06:51:59,132 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 06:51:59,132 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:51:59,132 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 06:51:59,133 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 06:51:59,133 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 06:51:59,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:51:59,134 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:51:59,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:51:59,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:51:59,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:51:59,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 06:51:59,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:51:59,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 06:51:59,135 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:51:59,135 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:51:59,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 06:51:59,135 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:51:59,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 06:51:59,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:51:59,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:51:59,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:51:59,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:51:59,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:51:59,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 06:51:59,137 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 06:51:59,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 06:51:59,137 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 06:51:59,137 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:51:59,137 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:51:59,138 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f428802ac72f1d2a0fe821ea4740cdcba55def6a [2020-12-09 06:51:59,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:51:59,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:51:59,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:51:59,347 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:51:59,348 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:51:59,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label07.c [2020-12-09 06:51:59,398 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data/3c8a2fb0d/f4e38a5255fd4cacbf28bfd79722d406/FLAGda8c90cf4 [2020-12-09 06:51:59,827 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:51:59,828 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/sv-benchmarks/c/eca-rers2012/Problem10_label07.c [2020-12-09 06:51:59,837 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data/3c8a2fb0d/f4e38a5255fd4cacbf28bfd79722d406/FLAGda8c90cf4 [2020-12-09 06:51:59,846 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data/3c8a2fb0d/f4e38a5255fd4cacbf28bfd79722d406 [2020-12-09 06:51:59,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:51:59,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:51:59,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:51:59,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:51:59,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:51:59,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:51:59" (1/1) ... [2020-12-09 06:51:59,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18438608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:51:59, skipping insertion in model container [2020-12-09 06:51:59,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:51:59" (1/1) ... [2020-12-09 06:51:59,861 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:51:59,893 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:52:00,038 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/sv-benchmarks/c/eca-rers2012/Problem10_label07.c[5227,5240] [2020-12-09 06:52:00,153 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:52:00,162 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 06:52:00,184 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/sv-benchmarks/c/eca-rers2012/Problem10_label07.c[5227,5240] [2020-12-09 06:52:00,240 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:52:00,254 INFO L208 MainTranslator]: Completed translation [2020-12-09 06:52:00,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00 WrapperNode [2020-12-09 06:52:00,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:52:00,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 06:52:00,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 06:52:00,256 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 06:52:00,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... [2020-12-09 06:52:00,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... [2020-12-09 06:52:00,319 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 06:52:00,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 06:52:00,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 06:52:00,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 06:52:00,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... [2020-12-09 06:52:00,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... [2020-12-09 06:52:00,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... [2020-12-09 06:52:00,331 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... [2020-12-09 06:52:00,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... [2020-12-09 06:52:00,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... [2020-12-09 06:52:00,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... [2020-12-09 06:52:00,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 06:52:00,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 06:52:00,375 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 06:52:00,375 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 06:52:00,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:52:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 06:52:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 06:52:00,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 06:52:00,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 06:52:08,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 06:52:08,656 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 06:52:08,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:52:08 BoogieIcfgContainer [2020-12-09 06:52:08,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 06:52:08,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 06:52:08,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 06:52:08,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 06:52:08,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:51:59" (1/3) ... [2020-12-09 06:52:08,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33de24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:52:08, skipping insertion in model container [2020-12-09 06:52:08,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:52:00" (2/3) ... [2020-12-09 06:52:08,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33de24f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:52:08, skipping insertion in model container [2020-12-09 06:52:08,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:52:08" (3/3) ... [2020-12-09 06:52:08,663 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label07.c [2020-12-09 06:52:08,673 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 06:52:08,676 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 06:52:08,683 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 06:52:08,698 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 06:52:08,698 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 06:52:08,698 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 06:52:08,698 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 06:52:08,698 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 06:52:08,698 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 06:52:08,698 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 06:52:08,698 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 06:52:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 06:52:08,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 06:52:08,709 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:52:08,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 06:52:08,710 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:52:08,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:52:08,714 INFO L82 PathProgramCache]: Analyzing trace with hash 857614682, now seen corresponding path program 1 times [2020-12-09 06:52:08,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:52:08,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274766110] [2020-12-09 06:52:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:52:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:52:08,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:52:08,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274766110] [2020-12-09 06:52:08,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:52:08,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:52:08,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710033274] [2020-12-09 06:52:08,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 06:52:08,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 06:52:08,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 06:52:08,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:52:08,881 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-09 06:52:08,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:52:08,934 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 06:52:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 06:52:08,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 06:52:08,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:52:08,941 INFO L225 Difference]: With dead ends: 23 [2020-12-09 06:52:08,941 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 06:52:08,943 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 06:52:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 06:52:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 06:52:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 06:52:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 06:52:08,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 06:52:08,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:52:08,965 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 06:52:08,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 06:52:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 06:52:08,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 06:52:08,965 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:52:08,965 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 06:52:08,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 06:52:08,966 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:52:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:52:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash -199336412, now seen corresponding path program 1 times [2020-12-09 06:52:08,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 06:52:08,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950986704] [2020-12-09 06:52:08,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 06:52:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:52:09,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:52:09,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950986704] [2020-12-09 06:52:09,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353848914] [2020-12-09 06:52:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/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 [2020-12-09 06:52:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:52:09,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-09 06:52:09,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:52:09,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 2, 4, 2, 4, 2, 4, 2, 4, 1] term [2020-12-09 06:52:09,470 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 06:52:09,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:52:09,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:52:09,804 WARN L197 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 1668 DAG size of output: 895 [2020-12-09 06:52:09,855 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,855 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,856 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,856 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,862 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,862 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,863 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,863 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,871 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,872 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,873 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:09,873 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,874 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,874 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,876 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,876 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,882 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,883 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,888 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,889 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,890 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:09,891 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,892 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:09,892 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,893 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:09,893 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,894 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,894 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,896 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,896 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,897 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:09,897 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,898 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,898 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,899 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,899 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,900 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:09,900 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,901 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:09,901 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,901 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,902 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,903 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,903 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,904 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:09,904 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,905 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,905 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,906 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,906 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,909 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,910 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,913 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,913 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,916 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,916 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,919 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,919 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,922 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,922 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,925 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,926 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,926 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:52:09,927 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,927 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:52:09,928 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,928 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,928 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,930 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:52:09,931 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,933 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,933 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,937 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,937 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,938 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,938 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,944 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,944 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,947 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,948 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,951 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,952 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,953 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,953 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,957 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,958 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,961 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,961 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,963 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,963 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,967 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,968 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,971 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,971 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,972 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,972 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,976 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,977 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,979 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,980 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,980 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,981 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,985 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,985 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,987 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,988 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,990 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 10, 7, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,990 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,992 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,992 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,993 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:09,993 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,996 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,996 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,998 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,998 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:09,999 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:09,999 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,000 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,001 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,002 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,002 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,003 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,003 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,005 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,005 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,008 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:52:10,008 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,009 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:52:10,010 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,011 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,011 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,012 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:52:10,013 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,014 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,014 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,015 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:10,016 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,017 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:10,017 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,018 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,018 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,019 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,019 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,021 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 06:52:10,021 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,022 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,022 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,023 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,023 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,024 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,024 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,026 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,026 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,027 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:52:10,028 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,029 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,029 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,031 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,032 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,033 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,033 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,035 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,036 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,038 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 06:52:10,039 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,039 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,040 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,041 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,041 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,042 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:52:10,043 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,047 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,048 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,051 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,051 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,054 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,054 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,057 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,057 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,059 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,060 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,062 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,062 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,064 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,064 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,065 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,065 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,078 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,078 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,081 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,081 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,083 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,084 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,086 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,086 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,088 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,089 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,091 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,091 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,093 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,094 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,096 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,096 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,098 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 13, 7, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,098 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,100 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,100 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,102 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 10, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,103 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,104 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,104 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,106 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,106 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,107 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,107 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,108 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,108 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,109 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,109 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,112 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,113 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,115 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,115 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,117 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,117 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,119 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,119 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,121 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 5, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,122 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,123 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,123 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,126 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,126 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,127 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,128 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,129 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,129 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,131 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,131 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,132 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,133 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,134 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,134 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,136 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 11, 6, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,136 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,137 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 11, 7, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,137 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,139 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,139 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,140 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,140 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,142 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 13, 7, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,142 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,144 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,144 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,145 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,145 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,146 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,146 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,147 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,147 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,148 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,148 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,149 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,149 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,150 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 8, 7, 2, 1] term [2020-12-09 06:52:10,150 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:52:10,537 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 34 [2020-12-09 06:52:10,582 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 7, 1] term [2020-12-09 06:52:10,583 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 06:52:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:52:10,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1036093484] [2020-12-09 06:52:10,625 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 06:52:10,626 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 06:52:10,629 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 06:52:10,632 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 06:52:10,632 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 06:52:10,762 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 40 [2020-12-09 06:52:11,110 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 40 [2020-12-09 06:52:11,732 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 1678 DAG size of output: 1593 [2020-12-09 07:00:57,995 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 07:00:57,997 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: variable got div captured at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:319) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:190) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminate(DualJunctionDer.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:776) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:739) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:656) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:151) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1133) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 07:00:58,010 INFO L168 Benchmark]: Toolchain (without parser) took 538156.56 ms. Allocated memory was 125.8 MB in the beginning and 952.1 MB in the end (delta: 826.3 MB). Free memory was 88.9 MB in the beginning and 450.1 MB in the end (delta: -361.2 MB). Peak memory consumption was 609.3 MB. Max. memory is 16.1 GB. [2020-12-09 07:00:58,012 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 125.8 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:00:58,014 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.77 ms. Allocated memory is still 125.8 MB. Free memory was 88.7 MB in the beginning and 85.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 07:00:58,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.32 ms. Allocated memory is still 125.8 MB. Free memory was 85.4 MB in the beginning and 77.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 07:00:58,018 INFO L168 Benchmark]: Boogie Preprocessor took 54.20 ms. Allocated memory is still 125.8 MB. Free memory was 77.9 MB in the beginning and 71.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 07:00:58,020 INFO L168 Benchmark]: RCFGBuilder took 8283.61 ms. Allocated memory was 125.8 MB in the beginning and 262.1 MB in the end (delta: 136.3 MB). Free memory was 71.5 MB in the beginning and 77.5 MB in the end (delta: -6.0 MB). Peak memory consumption was 148.5 MB. Max. memory is 16.1 GB. [2020-12-09 07:00:58,022 INFO L168 Benchmark]: TraceAbstraction took 529346.17 ms. Allocated memory was 262.1 MB in the beginning and 952.1 MB in the end (delta: 690.0 MB). Free memory was 77.5 MB in the beginning and 450.1 MB in the end (delta: -372.6 MB). Peak memory consumption was 462.1 MB. Max. memory is 16.1 GB. [2020-12-09 07:00:58,031 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 125.8 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 404.77 ms. Allocated memory is still 125.8 MB. Free memory was 88.7 MB in the beginning and 85.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.32 ms. Allocated memory is still 125.8 MB. Free memory was 85.4 MB in the beginning and 77.9 MB in the end (delta: 7.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.20 ms. Allocated memory is still 125.8 MB. Free memory was 77.9 MB in the beginning and 71.5 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 8283.61 ms. Allocated memory was 125.8 MB in the beginning and 262.1 MB in the end (delta: 136.3 MB). Free memory was 71.5 MB in the beginning and 77.5 MB in the end (delta: -6.0 MB). Peak memory consumption was 148.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 529346.17 ms. Allocated memory was 262.1 MB in the beginning and 952.1 MB in the end (delta: 690.0 MB). Free memory was 77.5 MB in the beginning and 450.1 MB in the end (delta: -372.6 MB). Peak memory consumption was 462.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: variable got div captured de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: variable got div captured: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 07:00:59,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 07:00:59,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 07:00:59,586 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 07:00:59,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 07:00:59,588 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 07:00:59,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 07:00:59,591 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 07:00:59,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 07:00:59,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 07:00:59,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 07:00:59,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 07:00:59,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 07:00:59,597 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 07:00:59,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 07:00:59,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 07:00:59,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 07:00:59,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 07:00:59,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 07:00:59,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 07:00:59,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 07:00:59,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 07:00:59,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 07:00:59,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 07:00:59,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 07:00:59,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 07:00:59,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 07:00:59,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 07:00:59,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 07:00:59,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 07:00:59,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 07:00:59,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 07:00:59,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 07:00:59,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 07:00:59,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 07:00:59,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 07:00:59,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 07:00:59,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 07:00:59,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 07:00:59,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 07:00:59,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 07:00:59,621 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 07:00:59,638 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 07:00:59,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 07:00:59,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 07:00:59,639 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 07:00:59,639 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 07:00:59,639 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 07:00:59,639 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 07:00:59,640 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 07:00:59,640 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 07:00:59,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 07:00:59,640 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 07:00:59,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 07:00:59,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 07:00:59,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 07:00:59,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 07:00:59,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 07:00:59,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 07:00:59,641 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 07:00:59,641 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 07:00:59,641 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 07:00:59,642 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 07:00:59,642 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 07:00:59,642 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 07:00:59,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 07:00:59,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 07:00:59,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 07:00:59,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:00:59,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 07:00:59,643 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 07:00:59,643 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 07:00:59,643 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 07:00:59,643 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 07:00:59,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 07:00:59,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 07:00:59,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 07:00:59,643 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f428802ac72f1d2a0fe821ea4740cdcba55def6a [2020-12-09 07:00:59,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 07:00:59,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 07:00:59,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 07:00:59,907 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 07:00:59,907 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 07:00:59,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label07.c [2020-12-09 07:00:59,950 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data/3d0cf0417/b6b477d4118d423898dd6aba15d5022c/FLAG288dec78b [2020-12-09 07:01:00,419 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 07:01:00,419 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/sv-benchmarks/c/eca-rers2012/Problem10_label07.c [2020-12-09 07:01:00,431 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data/3d0cf0417/b6b477d4118d423898dd6aba15d5022c/FLAG288dec78b [2020-12-09 07:01:00,443 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/data/3d0cf0417/b6b477d4118d423898dd6aba15d5022c [2020-12-09 07:01:00,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 07:01:00,447 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 07:01:00,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 07:01:00,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 07:01:00,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 07:01:00,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65b4873d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00, skipping insertion in model container [2020-12-09 07:01:00,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 07:01:00,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 07:01:00,654 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/sv-benchmarks/c/eca-rers2012/Problem10_label07.c[5227,5240] [2020-12-09 07:01:00,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:01:00,774 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 07:01:00,792 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/sv-benchmarks/c/eca-rers2012/Problem10_label07.c[5227,5240] [2020-12-09 07:01:00,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 07:01:00,862 INFO L208 MainTranslator]: Completed translation [2020-12-09 07:01:00,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00 WrapperNode [2020-12-09 07:01:00,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 07:01:00,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 07:01:00,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 07:01:00,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 07:01:00,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,918 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 07:01:00,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 07:01:00,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 07:01:00,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 07:01:00,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,946 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,954 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... [2020-12-09 07:01:00,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 07:01:00,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 07:01:00,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 07:01:00,966 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 07:01:00,967 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 07:01:01,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 07:01:01,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 07:01:01,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 07:01:01,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 07:01:03,063 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 07:01:03,063 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 07:01:03,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:01:03 BoogieIcfgContainer [2020-12-09 07:01:03,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 07:01:03,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 07:01:03,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 07:01:03,068 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 07:01:03,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:01:00" (1/3) ... [2020-12-09 07:01:03,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2412aa11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:01:03, skipping insertion in model container [2020-12-09 07:01:03,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:01:00" (2/3) ... [2020-12-09 07:01:03,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2412aa11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:01:03, skipping insertion in model container [2020-12-09 07:01:03,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:01:03" (3/3) ... [2020-12-09 07:01:03,070 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label07.c [2020-12-09 07:01:03,079 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 07:01:03,081 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 07:01:03,088 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 07:01:03,105 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 07:01:03,105 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 07:01:03,105 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 07:01:03,105 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 07:01:03,105 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 07:01:03,105 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 07:01:03,105 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 07:01:03,105 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 07:01:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-12-09 07:01:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-09 07:01:03,123 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:01:03,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:01:03,123 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:01:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:01:03,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2020-12-09 07:01:03,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:01:03,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033723816] [2020-12-09 07:01:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 07:01:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:01:03,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:01:03,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:01:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:01:03,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:01:03,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033723816] [2020-12-09 07:01:03,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:01:03,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:01:03,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263550292] [2020-12-09 07:01:03,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:01:03,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:01:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:01:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:03,311 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2020-12-09 07:01:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:01:05,790 INFO L93 Difference]: Finished difference Result 567 states and 981 transitions. [2020-12-09 07:01:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:01:05,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-09 07:01:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:01:05,800 INFO L225 Difference]: With dead ends: 567 [2020-12-09 07:01:05,800 INFO L226 Difference]: Without dead ends: 282 [2020-12-09 07:01:05,803 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-09 07:01:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-12-09 07:01:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-09 07:01:05,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 392 transitions. [2020-12-09 07:01:05,839 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 392 transitions. Word has length 45 [2020-12-09 07:01:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:01:05,840 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 392 transitions. [2020-12-09 07:01:05,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:01:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 392 transitions. [2020-12-09 07:01:05,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-09 07:01:05,843 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:01:05,843 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:01:06,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 07:01:06,045 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:01:06,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:01:06,048 INFO L82 PathProgramCache]: Analyzing trace with hash 5391356, now seen corresponding path program 1 times [2020-12-09 07:01:06,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:01:06,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418734572] [2020-12-09 07:01:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 07:01:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:01:06,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:01:06,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:01:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:01:06,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:01:06,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418734572] [2020-12-09 07:01:06,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:01:06,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:01:06,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346381159] [2020-12-09 07:01:06,222 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:01:06,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:01:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:01:06,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:06,224 INFO L87 Difference]: Start difference. First operand 282 states and 392 transitions. Second operand 3 states. [2020-12-09 07:01:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:01:08,689 INFO L93 Difference]: Finished difference Result 701 states and 997 transitions. [2020-12-09 07:01:08,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:01:08,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-12-09 07:01:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:01:08,692 INFO L225 Difference]: With dead ends: 701 [2020-12-09 07:01:08,692 INFO L226 Difference]: Without dead ends: 421 [2020-12-09 07:01:08,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:08,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-12-09 07:01:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-12-09 07:01:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-12-09 07:01:08,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 571 transitions. [2020-12-09 07:01:08,716 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 571 transitions. Word has length 111 [2020-12-09 07:01:08,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:01:08,717 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 571 transitions. [2020-12-09 07:01:08,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:01:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 571 transitions. [2020-12-09 07:01:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-09 07:01:08,720 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:01:08,720 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:01:08,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 07:01:08,922 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:01:08,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:01:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash -335852144, now seen corresponding path program 1 times [2020-12-09 07:01:08,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:01:08,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177697659] [2020-12-09 07:01:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 07:01:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:01:09,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 07:01:09,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:01:09,192 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:01:09,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:01:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:01:09,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177697659] [2020-12-09 07:01:09,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [191699740] [2020-12-09 07:01:09,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt [2020-12-09 07:01:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:01:09,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-09 07:01:09,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:01:09,753 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:01:09,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:01:09,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 07:01:09,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2020-12-09 07:01:09,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222933156] [2020-12-09 07:01:09,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 07:01:09,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:01:09,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 07:01:09,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-09 07:01:09,756 INFO L87 Difference]: Start difference. First operand 421 states and 571 transitions. Second operand 4 states. [2020-12-09 07:01:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:01:20,080 INFO L93 Difference]: Finished difference Result 1118 states and 1595 transitions. [2020-12-09 07:01:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 07:01:20,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2020-12-09 07:01:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:01:20,083 INFO L225 Difference]: With dead ends: 1118 [2020-12-09 07:01:20,084 INFO L226 Difference]: Without dead ends: 699 [2020-12-09 07:01:20,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-12-09 07:01:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-12-09 07:01:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 560. [2020-12-09 07:01:20,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 07:01:20,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 781 transitions. [2020-12-09 07:01:20,096 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 781 transitions. Word has length 120 [2020-12-09 07:01:20,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:01:20,096 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 781 transitions. [2020-12-09 07:01:20,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 07:01:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 781 transitions. [2020-12-09 07:01:20,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2020-12-09 07:01:20,097 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:01:20,098 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:01:20,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt [2020-12-09 07:01:20,500 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:01:20,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:01:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1682261323, now seen corresponding path program 1 times [2020-12-09 07:01:20,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:01:20,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580184751] [2020-12-09 07:01:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 07:01:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:01:20,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:01:20,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:01:20,642 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:01:20,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:01:20,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580184751] [2020-12-09 07:01:20,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:01:20,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 07:01:20,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981683567] [2020-12-09 07:01:20,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:01:20,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:01:20,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:01:20,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:20,644 INFO L87 Difference]: Start difference. First operand 560 states and 781 transitions. Second operand 3 states. [2020-12-09 07:01:23,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:01:23,478 INFO L93 Difference]: Finished difference Result 1396 states and 2012 transitions. [2020-12-09 07:01:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:01:23,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2020-12-09 07:01:23,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:01:23,483 INFO L225 Difference]: With dead ends: 1396 [2020-12-09 07:01:23,483 INFO L226 Difference]: Without dead ends: 977 [2020-12-09 07:01:23,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2020-12-09 07:01:23,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2020-12-09 07:01:23,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-09 07:01:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1067 transitions. [2020-12-09 07:01:23,498 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1067 transitions. Word has length 122 [2020-12-09 07:01:23,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:01:23,498 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1067 transitions. [2020-12-09 07:01:23,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:01:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1067 transitions. [2020-12-09 07:01:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-12-09 07:01:23,502 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:01:23,502 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:01:23,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 07:01:23,704 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:01:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:01:23,705 INFO L82 PathProgramCache]: Analyzing trace with hash 673995839, now seen corresponding path program 1 times [2020-12-09 07:01:23,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:01:23,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126738011] [2020-12-09 07:01:23,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 07:01:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:01:23,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:01:23,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:01:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-09 07:01:24,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:01:24,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126738011] [2020-12-09 07:01:24,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:01:24,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:01:24,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266119246] [2020-12-09 07:01:24,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:01:24,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:01:24,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:01:24,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:24,038 INFO L87 Difference]: Start difference. First operand 838 states and 1067 transitions. Second operand 3 states. [2020-12-09 07:01:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:01:26,662 INFO L93 Difference]: Finished difference Result 1952 states and 2604 transitions. [2020-12-09 07:01:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:01:26,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2020-12-09 07:01:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:01:26,667 INFO L225 Difference]: With dead ends: 1952 [2020-12-09 07:01:26,667 INFO L226 Difference]: Without dead ends: 1255 [2020-12-09 07:01:26,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-12-09 07:01:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116. [2020-12-09 07:01:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2020-12-09 07:01:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1395 transitions. [2020-12-09 07:01:26,688 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1395 transitions. Word has length 209 [2020-12-09 07:01:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:01:26,688 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1395 transitions. [2020-12-09 07:01:26,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:01:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1395 transitions. [2020-12-09 07:01:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-12-09 07:01:26,691 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:01:26,691 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:01:26,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 07:01:26,892 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:01:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:01:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1594537044, now seen corresponding path program 1 times [2020-12-09 07:01:26,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:01:26,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791156724] [2020-12-09 07:01:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 07:01:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:01:26,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 07:01:26,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:01:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:01:27,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:01:27,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791156724] [2020-12-09 07:01:27,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 07:01:27,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 07:01:27,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314761360] [2020-12-09 07:01:27,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 07:01:27,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:01:27,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 07:01:27,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:27,126 INFO L87 Difference]: Start difference. First operand 1116 states and 1395 transitions. Second operand 3 states. [2020-12-09 07:01:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:01:29,633 INFO L93 Difference]: Finished difference Result 2508 states and 3260 transitions. [2020-12-09 07:01:29,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 07:01:29,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 243 [2020-12-09 07:01:29,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:01:29,639 INFO L225 Difference]: With dead ends: 2508 [2020-12-09 07:01:29,639 INFO L226 Difference]: Without dead ends: 1533 [2020-12-09 07:01:29,640 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 07:01:29,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1533 states. [2020-12-09 07:01:29,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1533 to 1394. [2020-12-09 07:01:29,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2020-12-09 07:01:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1694 transitions. [2020-12-09 07:01:29,663 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1694 transitions. Word has length 243 [2020-12-09 07:01:29,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:01:29,664 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 1694 transitions. [2020-12-09 07:01:29,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 07:01:29,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1694 transitions. [2020-12-09 07:01:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-12-09 07:01:29,667 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 07:01:29,667 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 07:01:29,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 07:01:29,868 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 07:01:29,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 07:01:29,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1761365890, now seen corresponding path program 1 times [2020-12-09 07:01:29,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 07:01:29,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907866899] [2020-12-09 07:01:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 07:01:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:01:30,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 07:01:30,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:01:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 85 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:01:30,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 07:01:30,843 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-12-09 07:01:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 85 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 07:01:31,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907866899] [2020-12-09 07:01:31,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [44974192] [2020-12-09 07:01:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt [2020-12-09 07:01:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 07:01:31,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 07:01:31,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 07:01:31,855 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:01:31,856 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:01:31,858 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:01:31,862 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 07:01:31,865 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 07:01:31,865 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 07:01:31,868 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 07:01:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-12-09 07:01:32,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 07:01:32,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 07:01:32,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3] total 11 [2020-12-09 07:01:32,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405426539] [2020-12-09 07:01:32,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 07:01:32,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 07:01:32,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 07:01:32,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-12-09 07:01:32,042 INFO L87 Difference]: Start difference. First operand 1394 states and 1694 transitions. Second operand 7 states. [2020-12-09 07:01:35,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 07:01:35,415 INFO L93 Difference]: Finished difference Result 3246 states and 4021 transitions. [2020-12-09 07:01:35,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 07:01:35,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 288 [2020-12-09 07:01:35,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 07:01:35,416 INFO L225 Difference]: With dead ends: 3246 [2020-12-09 07:01:35,416 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 07:01:35,419 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 863 GetRequests, 853 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-09 07:01:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 07:01:35,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 07:01:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 07:01:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 07:01:35,419 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 288 [2020-12-09 07:01:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 07:01:35,419 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 07:01:35,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 07:01:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 07:01:35,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 07:01:35,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt [2020-12-09 07:01:35,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 07:01:36,003 INFO L262 CegarLoopResult]: For program point L597(line 597) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L564(lines 564 582) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L333(lines 333 582) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L367(lines 367 582) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L301(lines 301 582) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L235(lines 235 582) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L202-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L169-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L136-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L103-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,004 INFO L262 CegarLoopResult]: For program point L70-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L37-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L533(lines 533 582) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L567(lines 567 582) no Hoare annotation was computed. [2020-12-09 07:01:36,005 INFO L262 CegarLoopResult]: For program point L435(lines 435 582) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L336(lines 336 582) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L270(lines 270 582) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L403(lines 403 582) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L370(lines 370 582) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L205-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L172-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L139-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L106-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L73-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,006 INFO L262 CegarLoopResult]: For program point L40-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,007 INFO L262 CegarLoopResult]: For program point L536(lines 536 582) no Hoare annotation was computed. [2020-12-09 07:01:36,007 INFO L262 CegarLoopResult]: For program point L503(lines 503 582) no Hoare annotation was computed. [2020-12-09 07:01:36,007 INFO L262 CegarLoopResult]: For program point L470(lines 470 582) no Hoare annotation was computed. [2020-12-09 07:01:36,007 INFO L262 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-09 07:01:36,007 INFO L262 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-09 07:01:36,007 INFO L262 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-09 07:01:36,007 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-09 07:01:36,007 INFO L262 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-09 07:01:36,007 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L339(lines 339 582) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L306(lines 306 582) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L241(lines 241 582) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L208-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L175-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L142-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L109-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L76-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L43-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,008 INFO L262 CegarLoopResult]: For program point L539(lines 539 582) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L440(lines 440 582) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L275(lines 275 582) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L573(lines 573 582) no Hoare annotation was computed. [2020-12-09 07:01:36,009 INFO L262 CegarLoopResult]: For program point L408(lines 408 582) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L375(lines 375 582) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L475(lines 475 582) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L211-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L178-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L145-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L112-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L79-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L46-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L509(lines 509 582) no Hoare annotation was computed. [2020-12-09 07:01:36,010 INFO L262 CegarLoopResult]: For program point L311(lines 311 582) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L345(lines 345 582) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L246(lines 246 582) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L544(lines 544 582) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L181-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,011 INFO L262 CegarLoopResult]: For program point L148-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L115-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L82-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L49-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L446(lines 446 582) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L413(lines 413 582) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L380(lines 380 582) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L281(lines 281 582) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-09 07:01:36,012 INFO L262 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L579(lines 579 582) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L249(lines 249 582) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L514(lines 514 582) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L481(lines 481 582) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L316(lines 316 582) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L184-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L151-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L118-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L85-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L52-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,013 INFO L262 CegarLoopResult]: For program point L350(lines 350 582) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L258 CegarLoopResult]: At program point L583(lines 30 584) the Hoare annotation is: (or (not (bvsle ~a1~0 (_ bv4294967283 32))) (= (_ bv9 32) ~a19~0) (not (= (_ bv0 32) (bvadd ~a4~0 (_ bv4294967282 32)))) (not (= (_ bv2 32) ~a10~0)) (not (= (_ bv0 32) ~a12~0)) (= (_ bv8 32) ~a19~0)) [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L550(lines 550 582) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L418(lines 418 582) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L385(lines 385 582) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L220(lines 220 582) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L187-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L154-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,014 INFO L262 CegarLoopResult]: For program point L121-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L88-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L55-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L452(lines 452 582) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L287(lines 287 582) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L254(lines 254 582) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L519(lines 519 582) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L486(lines 486 582) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L265 CegarLoopResult]: At program point L586(lines 586 602) the Hoare annotation is: true [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L388(lines 388 582) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L355(lines 355 582) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point L322(lines 322 582) no Hoare annotation was computed. [2020-12-09 07:01:36,015 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L190-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L157-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L124-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L91-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L58-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L555(lines 555 582) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L225(lines 225 582) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L424(lines 424 582) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L259(lines 259 582) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L193-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L160-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L127-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,016 INFO L262 CegarLoopResult]: For program point L94-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L61-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L524(lines 524 582) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L491(lines 491 582) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L458(lines 458 582) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L293(lines 293 582) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L558(lines 558 582) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L393(lines 393 582) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L327(lines 327 582) no Hoare annotation was computed. [2020-12-09 07:01:36,017 INFO L258 CegarLoopResult]: At program point L592-2(lines 592 601) the Hoare annotation is: (or (not (bvsle ~a1~0 (_ bv4294967283 32))) (= (_ bv9 32) ~a19~0) (not (= (_ bv0 32) (bvadd ~a4~0 (_ bv4294967282 32)))) (not (= (_ bv2 32) ~a10~0)) (not (= (_ bv0 32) ~a12~0)) (= (_ bv8 32) ~a19~0)) [2020-12-09 07:01:36,017 INFO L262 CegarLoopResult]: For program point L361(lines 361 582) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L196-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L163-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L130-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L97-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L64-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L31-2(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L527(lines 527 582) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L296(lines 296 582) no Hoare annotation was computed. [2020-12-09 07:01:36,018 INFO L262 CegarLoopResult]: For program point L230(lines 230 582) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L429(lines 429 582) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L330(lines 330 582) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L264(lines 264 582) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L364(lines 364 582) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L199-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L166-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L133-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,019 INFO L262 CegarLoopResult]: For program point L100-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L67-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L34-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L497(lines 497 582) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L464(lines 464 582) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L398(lines 398 582) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-09 07:01:36,020 INFO L262 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-09 07:01:36,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:01:36 BoogieIcfgContainer [2020-12-09 07:01:36,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 07:01:36,034 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 07:01:36,034 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 07:01:36,035 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 07:01:36,035 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:01:03" (3/4) ... [2020-12-09 07:01:36,038 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 07:01:36,055 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 07:01:36,057 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 07:01:36,058 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 07:01:36,059 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 07:01:36,141 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3a46caf2-8074-4b09-9444-d0d52d704a58/bin/utaipan/witness.graphml [2020-12-09 07:01:36,141 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 07:01:36,142 INFO L168 Benchmark]: Toolchain (without parser) took 35694.75 ms. Allocated memory was 60.8 MB in the beginning and 142.6 MB in the end (delta: 81.8 MB). Free memory was 38.4 MB in the beginning and 80.2 MB in the end (delta: -41.9 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. [2020-12-09 07:01:36,142 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 60.8 MB. Free memory was 43.8 MB in the beginning and 43.7 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 07:01:36,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.57 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 38.2 MB in the beginning and 60.4 MB in the end (delta: -22.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 07:01:36,142 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.91 ms. Allocated memory is still 79.7 MB. Free memory was 60.4 MB in the beginning and 55.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 07:01:36,143 INFO L168 Benchmark]: Boogie Preprocessor took 47.15 ms. Allocated memory is still 79.7 MB. Free memory was 55.1 MB in the beginning and 50.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 07:01:36,143 INFO L168 Benchmark]: RCFGBuilder took 2098.66 ms. Allocated memory is still 79.7 MB. Free memory was 50.6 MB in the beginning and 44.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. [2020-12-09 07:01:36,143 INFO L168 Benchmark]: TraceAbstraction took 32968.03 ms. Allocated memory was 79.7 MB in the beginning and 142.6 MB in the end (delta: 62.9 MB). Free memory was 44.1 MB in the beginning and 95.2 MB in the end (delta: -51.1 MB). Peak memory consumption was 70.7 MB. Max. memory is 16.1 GB. [2020-12-09 07:01:36,143 INFO L168 Benchmark]: Witness Printer took 106.58 ms. Allocated memory is still 142.6 MB. Free memory was 95.2 MB in the beginning and 80.2 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 07:01:36,145 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 60.8 MB. Free memory was 43.8 MB in the beginning and 43.7 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 414.57 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 38.2 MB in the beginning and 60.4 MB in the end (delta: -22.2 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.91 ms. Allocated memory is still 79.7 MB. Free memory was 60.4 MB in the beginning and 55.1 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.15 ms. Allocated memory is still 79.7 MB. Free memory was 55.1 MB in the beginning and 50.6 MB in the end (delta: 4.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2098.66 ms. Allocated memory is still 79.7 MB. Free memory was 50.6 MB in the beginning and 44.6 MB in the end (delta: 5.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 32968.03 ms. Allocated memory was 79.7 MB in the beginning and 142.6 MB in the end (delta: 62.9 MB). Free memory was 44.1 MB in the beginning and 95.2 MB in the end (delta: -51.1 MB). Peak memory consumption was 70.7 MB. Max. memory is 16.1 GB. * Witness Printer took 106.58 ms. Allocated memory is still 142.6 MB. Free memory was 95.2 MB in the beginning and 80.2 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((!~bvsle32(a1, 4294967283bv32) || 9bv32 == a19) || !(0bv32 == ~bvadd64(a4, 4294967282bv32))) || !(2bv32 == a10)) || !(0bv32 == a12)) || 8bv32 == a19 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((!~bvsle32(a1, 4294967283bv32) || 9bv32 == a19) || !(0bv32 == ~bvadd64(a4, 4294967282bv32))) || !(2bv32 == a10)) || !(0bv32 == a12)) || 8bv32 == a19 - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 32.7s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 26.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 694 SDtfs, 1273 SDslu, 54 SDs, 0 SdLazy, 3409 SolverSat, 642 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1947 GetRequests, 1924 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1394occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 556 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 41 NumberOfFragments, 51 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1300 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 46 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1546 NumberOfCodeBlocks, 1546 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1943 ConstructedInterpolants, 0 QuantifiedInterpolants, 3505316 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1996 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 809/1095 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...