./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label17.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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label17.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 83e367e336d886cb210bb14e3d6bd9f7963f3d26 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label17.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 83e367e336d886cb210bb14e3d6bd9f7963f3d26 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:50:25,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 09:50:25,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 09:50:25,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 09:50:25,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 09:50:25,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 09:50:25,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 09:50:25,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 09:50:25,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 09:50:25,922 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 09:50:25,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 09:50:25,924 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 09:50:25,925 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 09:50:25,925 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 09:50:25,926 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 09:50:25,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 09:50:25,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 09:50:25,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 09:50:25,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 09:50:25,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 09:50:25,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 09:50:25,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 09:50:25,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 09:50:25,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 09:50:25,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 09:50:25,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 09:50:25,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 09:50:25,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 09:50:25,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 09:50:25,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 09:50:25,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 09:50:25,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 09:50:25,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 09:50:25,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 09:50:25,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 09:50:25,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 09:50:25,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 09:50:25,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 09:50:25,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 09:50:25,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 09:50:25,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 09:50:25,948 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 09:50:25,965 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 09:50:25,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 09:50:25,966 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 09:50:25,966 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 09:50:25,966 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 09:50:25,967 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 09:50:25,967 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 09:50:25,967 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 09:50:25,967 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 09:50:25,967 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 09:50:25,967 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 09:50:25,967 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 09:50:25,967 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 09:50:25,967 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 09:50:25,968 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 09:50:25,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 09:50:25,968 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 09:50:25,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 09:50:25,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 09:50:25,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 09:50:25,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 09:50:25,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 09:50:25,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 09:50:25,969 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 09:50:25,969 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 09:50:25,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 09:50:25,969 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 09:50:25,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 09:50:25,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 09:50:25,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 09:50:25,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 09:50:25,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 09:50:25,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 09:50:25,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 09:50:25,970 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 09:50:25,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 09:50:25,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 09:50:25,970 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 09:50:25,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 09:50:25,971 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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 -> 83e367e336d886cb210bb14e3d6bd9f7963f3d26 [2020-12-09 09:50:26,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 09:50:26,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 09:50:26,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 09:50:26,170 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 09:50:26,170 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 09:50:26,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label17.c [2020-12-09 09:50:26,213 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data/40c13277b/2e32fb30f5914495ae7e49ed1237d913/FLAGffc636822 [2020-12-09 09:50:26,637 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 09:50:26,638 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/sv-benchmarks/c/eca-rers2012/Problem10_label17.c [2020-12-09 09:50:26,648 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data/40c13277b/2e32fb30f5914495ae7e49ed1237d913/FLAGffc636822 [2020-12-09 09:50:26,658 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data/40c13277b/2e32fb30f5914495ae7e49ed1237d913 [2020-12-09 09:50:26,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 09:50:26,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 09:50:26,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 09:50:26,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 09:50:26,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 09:50:26,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:50:26" (1/1) ... [2020-12-09 09:50:26,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40570d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:26, skipping insertion in model container [2020-12-09 09:50:26,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:50:26" (1/1) ... [2020-12-09 09:50:26,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 09:50:26,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 09:50:26,825 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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/sv-benchmarks/c/eca-rers2012/Problem10_label17.c[3604,3617] [2020-12-09 09:50:26,925 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 09:50:26,932 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 09:50:26,947 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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/sv-benchmarks/c/eca-rers2012/Problem10_label17.c[3604,3617] [2020-12-09 09:50:26,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 09:50:27,005 INFO L208 MainTranslator]: Completed translation [2020-12-09 09:50:27,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27 WrapperNode [2020-12-09 09:50:27,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 09:50:27,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 09:50:27,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 09:50:27,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 09:50:27,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... [2020-12-09 09:50:27,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... [2020-12-09 09:50:27,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 09:50:27,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 09:50:27,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 09:50:27,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 09:50:27,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... [2020-12-09 09:50:27,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... [2020-12-09 09:50:27,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... [2020-12-09 09:50:27,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... [2020-12-09 09:50:27,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... [2020-12-09 09:50:27,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... [2020-12-09 09:50:27,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... [2020-12-09 09:50:27,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 09:50:27,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 09:50:27,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 09:50:27,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 09:50:27,147 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 09:50:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 09:50:27,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 09:50:27,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 09:50:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 09:50:32,926 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 09:50:32,926 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 09:50:32,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:50:32 BoogieIcfgContainer [2020-12-09 09:50:32,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 09:50:32,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 09:50:32,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 09:50:32,931 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 09:50:32,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:50:26" (1/3) ... [2020-12-09 09:50:32,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9a9b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:50:32, skipping insertion in model container [2020-12-09 09:50:32,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:50:27" (2/3) ... [2020-12-09 09:50:32,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b9a9b2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:50:32, skipping insertion in model container [2020-12-09 09:50:32,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:50:32" (3/3) ... [2020-12-09 09:50:32,933 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label17.c [2020-12-09 09:50:32,943 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 09:50:32,945 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 09:50:32,952 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 09:50:32,967 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 09:50:32,968 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 09:50:32,968 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 09:50:32,968 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 09:50:32,968 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 09:50:32,968 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 09:50:32,968 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 09:50:32,968 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 09:50:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 09:50:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 09:50:32,979 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:32,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 09:50:32,979 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 857610842, now seen corresponding path program 1 times [2020-12-09 09:50:32,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 09:50:32,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134888649] [2020-12-09 09:50:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 09:50:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:33,125 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 09:50:33,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134888649] [2020-12-09 09:50:33,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:50:33,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 09:50:33,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707251891] [2020-12-09 09:50:33,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:50:33,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 09:50:33,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:50:33,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:50:33,146 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-09 09:50:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:50:33,209 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 09:50:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:50:33,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 09:50:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:50:33,218 INFO L225 Difference]: With dead ends: 23 [2020-12-09 09:50:33,219 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 09:50:33,221 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 09:50:33,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 09:50:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 09:50:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 09:50:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 09:50:33,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 09:50:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:50:33,243 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 09:50:33,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:50:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 09:50:33,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 09:50:33,244 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:50:33,244 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 09:50:33,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 09:50:33,244 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:50:33,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:50:33,245 INFO L82 PathProgramCache]: Analyzing trace with hash 660128924, now seen corresponding path program 1 times [2020-12-09 09:50:33,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 09:50:33,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251068621] [2020-12-09 09:50:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 09:50:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:33,466 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 09:50:33,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251068621] [2020-12-09 09:50:33,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444024613] [2020-12-09 09:50:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 09:50:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:50:33,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 09:50:33,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:50:33,755 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 1003 DAG size of output: 128 [2020-12-09 09:50:33,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 3, 2, 3, 2, 3, 2, 3, 2, 3, 1] term [2020-12-09 09:50:33,792 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 09:50:33,795 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 09:50:33,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 09:50:33,901 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 09:50:33,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:50:34,136 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 1666 DAG size of output: 906 [2020-12-09 09:50:34,182 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,183 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,189 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,190 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,197 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,198 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,204 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,204 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,210 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,210 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,216 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,216 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,221 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,222 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,227 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,228 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,232 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,232 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,237 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,237 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,242 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,242 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,246 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,247 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,251 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,251 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,255 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,255 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,259 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,260 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,263 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,264 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,265 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,265 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,266 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,267 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,268 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,268 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,271 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,271 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,272 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,272 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,278 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,278 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,282 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,282 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,286 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,286 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,290 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,290 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,291 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,291 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,294 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,294 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,297 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,297 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,299 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,299 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,301 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,302 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,302 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,302 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,305 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,305 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,306 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,306 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,308 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,308 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,310 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,311 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,312 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,312 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,313 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,313 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,315 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,315 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,316 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,316 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,317 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,317 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,318 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,319 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,320 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,320 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,320 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,321 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,322 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,323 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,323 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,323 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,325 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,326 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,326 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,327 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,327 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,327 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,329 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,329 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,329 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,330 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,331 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,331 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,332 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,332 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,332 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,333 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,334 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,334 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,335 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,335 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,335 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,336 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,336 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,336 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,337 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,338 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,339 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,339 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,341 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,341 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,343 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,343 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,345 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,345 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,346 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,346 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,347 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,347 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,348 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,348 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,350 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,350 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,350 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,351 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,351 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,351 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,352 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,352 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,353 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,353 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,354 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,354 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,355 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,355 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,356 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,356 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,357 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,357 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,357 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,358 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,358 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,358 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,359 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,360 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,360 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 09:50:34,361 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,361 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,361 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,362 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,362 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,364 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,364 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,365 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,365 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,366 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,366 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,367 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,367 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,368 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,368 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,369 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 09:50:34,369 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,369 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,370 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,370 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,371 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,371 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 09:50:34,371 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,375 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,375 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,378 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,378 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,380 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,381 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,383 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,383 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,385 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,386 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,388 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,388 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,390 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,390 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,393 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,393 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,395 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,395 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,397 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,398 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,399 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,399 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,401 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,401 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,403 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,403 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,405 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,405 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,407 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,407 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,408 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,408 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,410 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,410 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,411 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,411 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,412 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,412 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,413 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,413 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,414 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 6, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,415 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,416 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,416 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,417 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,417 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,418 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,418 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,419 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,419 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,420 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,420 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,421 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,421 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,421 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,422 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,422 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,422 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,423 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,423 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,423 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,423 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,424 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,424 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:34,425 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 09:50:34,425 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 09:50:35,346 WARN L197 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 87 [2020-12-09 09:50:35,747 WARN L197 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2020-12-09 09:50:35,753 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 6, 5, 7, 5, 7, 5, 1] term [2020-12-09 09:50:35,754 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 09:50:35,927 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2020-12-09 09:50:35,928 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 09:50:35,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1260766615] [2020-12-09 09:50:35,943 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 09:50:35,943 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 09:50:35,946 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 09:50:35,949 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 09:50:35,950 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 09:50:36,052 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2020-12-09 09:50:36,187 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2020-12-09 09:50:36,655 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 1693 DAG size of output: 1608 [2020-12-09 09:59:41,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 09:59:41,598 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 09:59:41,606 INFO L168 Benchmark]: Toolchain (without parser) took 554944.33 ms. Allocated memory was 94.4 MB in the beginning and 916.5 MB in the end (delta: 822.1 MB). Free memory was 52.4 MB in the beginning and 812.8 MB in the end (delta: -760.4 MB). Peak memory consumption was 581.9 MB. Max. memory is 16.1 GB. [2020-12-09 09:59:41,607 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 94.4 MB. Free memory is still 70.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 09:59:41,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.42 ms. Allocated memory is still 94.4 MB. Free memory was 52.3 MB in the beginning and 48.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-12-09 09:59:41,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.93 ms. Allocated memory is still 94.4 MB. Free memory was 48.6 MB in the beginning and 68.2 MB in the end (delta: -19.6 MB). Peak memory consumption was 10.4 MB. Max. memory is 16.1 GB. [2020-12-09 09:59:41,609 INFO L168 Benchmark]: Boogie Preprocessor took 71.00 ms. Allocated memory is still 94.4 MB. Free memory was 68.2 MB in the beginning and 62.7 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 09:59:41,609 INFO L168 Benchmark]: RCFGBuilder took 5782.54 ms. Allocated memory was 94.4 MB in the beginning and 255.9 MB in the end (delta: 161.5 MB). Free memory was 62.7 MB in the beginning and 119.4 MB in the end (delta: -56.6 MB). Peak memory consumption was 176.3 MB. Max. memory is 16.1 GB. [2020-12-09 09:59:41,610 INFO L168 Benchmark]: TraceAbstraction took 548675.83 ms. Allocated memory was 255.9 MB in the beginning and 916.5 MB in the end (delta: 660.6 MB). Free memory was 118.3 MB in the beginning and 812.8 MB in the end (delta: -694.5 MB). Peak memory consumption was 486.2 MB. Max. memory is 16.1 GB. [2020-12-09 09:59:41,614 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.17 ms. Allocated memory is still 94.4 MB. Free memory is still 70.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 343.42 ms. Allocated memory is still 94.4 MB. Free memory was 52.3 MB in the beginning and 48.6 MB in the end (delta: 3.7 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.93 ms. Allocated memory is still 94.4 MB. Free memory was 48.6 MB in the beginning and 68.2 MB in the end (delta: -19.6 MB). Peak memory consumption was 10.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 71.00 ms. Allocated memory is still 94.4 MB. Free memory was 68.2 MB in the beginning and 62.7 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5782.54 ms. Allocated memory was 94.4 MB in the beginning and 255.9 MB in the end (delta: 161.5 MB). Free memory was 62.7 MB in the beginning and 119.4 MB in the end (delta: -56.6 MB). Peak memory consumption was 176.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 548675.83 ms. Allocated memory was 255.9 MB in the beginning and 916.5 MB in the end (delta: 660.6 MB). Free memory was 118.3 MB in the beginning and 812.8 MB in the end (delta: -694.5 MB). Peak memory consumption was 486.2 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 09:59:43,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 09:59:43,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 09:59:43,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 09:59:43,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 09:59:43,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 09:59:43,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 09:59:43,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 09:59:43,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 09:59:43,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 09:59:43,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 09:59:43,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 09:59:43,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 09:59:43,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 09:59:43,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 09:59:43,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 09:59:43,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 09:59:43,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 09:59:43,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 09:59:43,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 09:59:43,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 09:59:43,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 09:59:43,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 09:59:43,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 09:59:43,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 09:59:43,175 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 09:59:43,175 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 09:59:43,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 09:59:43,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 09:59:43,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 09:59:43,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 09:59:43,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 09:59:43,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 09:59:43,179 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 09:59:43,180 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 09:59:43,180 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 09:59:43,181 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 09:59:43,181 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 09:59:43,181 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 09:59:43,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 09:59:43,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 09:59:43,182 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 09:59:43,200 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 09:59:43,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 09:59:43,200 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 09:59:43,200 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 09:59:43,201 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 09:59:43,201 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 09:59:43,201 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 09:59:43,201 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 09:59:43,201 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 09:59:43,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 09:59:43,202 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 09:59:43,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 09:59:43,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 09:59:43,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 09:59:43,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 09:59:43,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 09:59:43,202 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 09:59:43,202 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 09:59:43,202 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 09:59:43,203 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 09:59:43,203 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 09:59:43,203 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 09:59:43,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 09:59:43,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 09:59:43,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 09:59:43,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 09:59:43,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 09:59:43,204 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 09:59:43,204 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 09:59:43,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 09:59:43,204 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 09:59:43,204 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 09:59:43,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 09:59:43,204 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 09:59:43,204 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 09:59:43,204 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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 -> 83e367e336d886cb210bb14e3d6bd9f7963f3d26 [2020-12-09 09:59:43,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 09:59:43,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 09:59:43,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 09:59:43,450 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 09:59:43,450 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 09:59:43,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label17.c [2020-12-09 09:59:43,496 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data/679768a49/8368843f070e4861919a4a8c48f2c91e/FLAG286090dc6 [2020-12-09 09:59:44,037 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 09:59:44,037 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/sv-benchmarks/c/eca-rers2012/Problem10_label17.c [2020-12-09 09:59:44,048 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data/679768a49/8368843f070e4861919a4a8c48f2c91e/FLAG286090dc6 [2020-12-09 09:59:44,472 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/data/679768a49/8368843f070e4861919a4a8c48f2c91e [2020-12-09 09:59:44,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 09:59:44,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 09:59:44,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 09:59:44,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 09:59:44,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 09:59:44,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a12e29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44, skipping insertion in model container [2020-12-09 09:59:44,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 09:59:44,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 09:59:44,641 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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/sv-benchmarks/c/eca-rers2012/Problem10_label17.c[3604,3617] [2020-12-09 09:59:44,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 09:59:44,774 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 09:59:44,791 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_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/sv-benchmarks/c/eca-rers2012/Problem10_label17.c[3604,3617] [2020-12-09 09:59:44,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 09:59:44,862 INFO L208 MainTranslator]: Completed translation [2020-12-09 09:59:44,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44 WrapperNode [2020-12-09 09:59:44,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 09:59:44,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 09:59:44,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 09:59:44,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 09:59:44,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 09:59:44" (1/1) ... [2020-12-09 09:59:44,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 09:59:44,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 09:59:44,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 09:59:44,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 09:59:44,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (1/1) ... [2020-12-09 09:59:44,962 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 09:59:44,963 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 09:59:44,963 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 09:59:44,963 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 09:59:44,964 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 09:59:45,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 09:59:45,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 09:59:45,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 09:59:45,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 09:59:47,010 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 09:59:47,011 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 09:59:47,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:59:47 BoogieIcfgContainer [2020-12-09 09:59:47,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 09:59:47,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 09:59:47,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 09:59:47,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 09:59:47,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:59:44" (1/3) ... [2020-12-09 09:59:47,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a11287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:59:47, skipping insertion in model container [2020-12-09 09:59:47,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:59:44" (2/3) ... [2020-12-09 09:59:47,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a11287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:59:47, skipping insertion in model container [2020-12-09 09:59:47,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:59:47" (3/3) ... [2020-12-09 09:59:47,017 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label17.c [2020-12-09 09:59:47,027 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 09:59:47,029 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 09:59:47,037 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 09:59:47,054 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 09:59:47,054 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 09:59:47,054 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 09:59:47,054 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 09:59:47,054 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 09:59:47,054 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 09:59:47,054 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 09:59:47,054 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 09:59:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-12-09 09:59:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-09 09:59:47,071 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:59:47,071 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] [2020-12-09 09:59:47,071 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:59:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:59:47,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1722039382, now seen corresponding path program 1 times [2020-12-09 09:59:47,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:59:47,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56718541] [2020-12-09 09:59:47,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 09:59:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:59:47,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 09:59:47,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:59:47,186 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 09:59:47,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:59:47,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56718541] [2020-12-09 09:59:47,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:59:47,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 09:59:47,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762869607] [2020-12-09 09:59:47,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:59:47,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:59:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:59:47,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:59:47,201 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2020-12-09 09:59:49,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:59:49,823 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2020-12-09 09:59:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:59:49,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-12-09 09:59:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:59:49,837 INFO L225 Difference]: With dead ends: 552 [2020-12-09 09:59:49,837 INFO L226 Difference]: Without dead ends: 282 [2020-12-09 09:59:49,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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 09:59:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-09 09:59:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-12-09 09:59:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-09 09:59:49,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2020-12-09 09:59:49,882 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 30 [2020-12-09 09:59:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:59:49,883 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2020-12-09 09:59:49,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:59:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2020-12-09 09:59:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2020-12-09 09:59:49,885 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:59:49,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:59:50,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 09:59:50,089 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:59:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:59:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash -496546090, now seen corresponding path program 1 times [2020-12-09 09:59:50,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:59:50,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339650498] [2020-12-09 09:59:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 09:59:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:59:50,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 09:59:50,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:59:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:59:50,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:59:50,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339650498] [2020-12-09 09:59:50,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:59:50,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 09:59:50,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211011505] [2020-12-09 09:59:50,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:59:50,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:59:50,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:59:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:59:50,258 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand 3 states. [2020-12-09 09:59:52,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:59:52,957 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2020-12-09 09:59:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:59:52,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2020-12-09 09:59:52,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:59:52,960 INFO L225 Difference]: With dead ends: 701 [2020-12-09 09:59:52,960 INFO L226 Difference]: Without dead ends: 421 [2020-12-09 09:59:52,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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 09:59:52,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-12-09 09:59:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-12-09 09:59:52,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-12-09 09:59:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2020-12-09 09:59:52,979 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 96 [2020-12-09 09:59:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:59:52,979 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2020-12-09 09:59:52,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:59:52,979 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2020-12-09 09:59:52,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-12-09 09:59:52,981 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:59:52,981 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:59:53,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 09:59:53,183 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:59:53,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:59:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash -393422231, now seen corresponding path program 1 times [2020-12-09 09:59:53,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:59:53,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099488988] [2020-12-09 09:59:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 09:59:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:59:53,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 09:59:53,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:59:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:59:53,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 09:59:53,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099488988] [2020-12-09 09:59:53,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 09:59:53,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 09:59:53,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084579789] [2020-12-09 09:59:53,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 09:59:53,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:59:53,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 09:59:53,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 09:59:53,466 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand 3 states. [2020-12-09 09:59:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 09:59:55,527 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2020-12-09 09:59:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 09:59:55,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2020-12-09 09:59:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 09:59:55,530 INFO L225 Difference]: With dead ends: 979 [2020-12-09 09:59:55,530 INFO L226 Difference]: Without dead ends: 560 [2020-12-09 09:59:55,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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 09:59:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-12-09 09:59:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-12-09 09:59:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 09:59:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2020-12-09 09:59:55,544 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 103 [2020-12-09 09:59:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 09:59:55,544 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2020-12-09 09:59:55,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 09:59:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2020-12-09 09:59:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-12-09 09:59:55,546 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 09:59:55,546 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:59:55,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 09:59:55,748 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 09:59:55,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 09:59:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1231744932, now seen corresponding path program 1 times [2020-12-09 09:59:55,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 09:59:55,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309798605] [2020-12-09 09:59:55,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 09:59:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 09:59:55,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 09:59:55,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 09:59:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:59:55,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 09:59:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 09:59:56,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309798605] [2020-12-09 09:59:56,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 09:59:56,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 09:59:56,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133101123] [2020-12-09 09:59:56,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 09:59:56,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 09:59:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 09:59:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 09:59:56,228 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand 4 states. [2020-12-09 10:00:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:00:23,052 INFO L93 Difference]: Finished difference Result 1415 states and 1741 transitions. [2020-12-09 10:00:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:00:23,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2020-12-09 10:00:23,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:00:23,059 INFO L225 Difference]: With dead ends: 1415 [2020-12-09 10:00:23,060 INFO L226 Difference]: Without dead ends: 977 [2020-12-09 10:00:23,060 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:00:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2020-12-09 10:00:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 560. [2020-12-09 10:00:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 10:00:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 672 transitions. [2020-12-09 10:00:23,071 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 672 transitions. Word has length 105 [2020-12-09 10:00:23,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:00:23,072 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 672 transitions. [2020-12-09 10:00:23,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:00:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 672 transitions. [2020-12-09 10:00:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-12-09 10:00:23,073 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:00:23,073 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:23,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 10:00:23,275 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:00:23,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:00:23,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1048270468, now seen corresponding path program 1 times [2020-12-09 10:00:23,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:00:23,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776915081] [2020-12-09 10:00:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 10:00:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:00:23,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 10:00:23,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:00:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:00:23,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 10:00:23,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776915081] [2020-12-09 10:00:23,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:00:23,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:00:23,453 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281959105] [2020-12-09 10:00:23,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:00:23,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:00:23,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:00:23,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:00:23,455 INFO L87 Difference]: Start difference. First operand 560 states and 672 transitions. Second operand 3 states. [2020-12-09 10:00:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:00:26,022 INFO L93 Difference]: Finished difference Result 1396 states and 1715 transitions. [2020-12-09 10:00:26,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:00:26,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2020-12-09 10:00:26,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:00:26,026 INFO L225 Difference]: With dead ends: 1396 [2020-12-09 10:00:26,026 INFO L226 Difference]: Without dead ends: 977 [2020-12-09 10:00:26,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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 10:00:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2020-12-09 10:00:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2020-12-09 10:00:26,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-09 10:00:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1003 transitions. [2020-12-09 10:00:26,040 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1003 transitions. Word has length 121 [2020-12-09 10:00:26,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:00:26,040 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1003 transitions. [2020-12-09 10:00:26,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:00:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1003 transitions. [2020-12-09 10:00:26,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2020-12-09 10:00:26,042 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:00:26,042 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:00:26,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 10:00:26,244 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:00:26,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:00:26,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1880634543, now seen corresponding path program 1 times [2020-12-09 10:00:26,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:00:26,249 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735955838] [2020-12-09 10:00:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 10:00:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:00:26,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 10:00:26,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:00:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-09 10:00:26,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 10:00:26,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735955838] [2020-12-09 10:00:26,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:00:26,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:00:26,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298791375] [2020-12-09 10:00:26,539 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:00:26,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:00:26,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:00:26,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:00:26,540 INFO L87 Difference]: Start difference. First operand 838 states and 1003 transitions. Second operand 3 states. [2020-12-09 10:00:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:00:29,084 INFO L93 Difference]: Finished difference Result 1813 states and 2263 transitions. [2020-12-09 10:00:29,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:00:29,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2020-12-09 10:00:29,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:00:29,088 INFO L225 Difference]: With dead ends: 1813 [2020-12-09 10:00:29,088 INFO L226 Difference]: Without dead ends: 1116 [2020-12-09 10:00:29,089 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 10:00:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-12-09 10:00:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2020-12-09 10:00:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2020-12-09 10:00:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1331 transitions. [2020-12-09 10:00:29,107 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1331 transitions. Word has length 209 [2020-12-09 10:00:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:00:29,107 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1331 transitions. [2020-12-09 10:00:29,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:00:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1331 transitions. [2020-12-09 10:00:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2020-12-09 10:00:29,113 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:00:29,113 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, 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, 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] [2020-12-09 10:00:29,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 10:00:29,314 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:00:29,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:00:29,315 INFO L82 PathProgramCache]: Analyzing trace with hash 321679273, now seen corresponding path program 1 times [2020-12-09 10:00:29,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:00:29,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742726092] [2020-12-09 10:00:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/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 10:00:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:00:29,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 10:00:29,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:00:29,870 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:00:29,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:00:30,907 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-12-09 10:00:31,295 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 24 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:00:31,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742726092] [2020-12-09 10:00:31,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2082540396] [2020-12-09 10:00:31,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt [2020-12-09 10:00:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:00:31,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 10:00:31,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:00:32,070 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 10:00:32,070 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 10:00:32,071 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 10:00:32,080 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 10:00:32,081 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 10:00:32,085 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 10:00:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-12-09 10:00:32,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 10:00:32,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 10:00:32,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4] total 13 [2020-12-09 10:00:32,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277090588] [2020-12-09 10:00:32,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 10:00:32,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:00:32,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 10:00:32,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-09 10:00:32,244 INFO L87 Difference]: Start difference. First operand 1116 states and 1331 transitions. Second operand 7 states. [2020-12-09 10:00:36,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:00:36,813 INFO L93 Difference]: Finished difference Result 2811 states and 3465 transitions. [2020-12-09 10:00:36,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 10:00:36,814 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 278 [2020-12-09 10:00:36,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:00:36,819 INFO L225 Difference]: With dead ends: 2811 [2020-12-09 10:00:36,819 INFO L226 Difference]: Without dead ends: 1394 [2020-12-09 10:00:36,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 821 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-12-09 10:00:36,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-12-09 10:00:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2020-12-09 10:00:36,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2020-12-09 10:00:36,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1676 transitions. [2020-12-09 10:00:36,841 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1676 transitions. Word has length 278 [2020-12-09 10:00:36,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:00:36,841 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 1676 transitions. [2020-12-09 10:00:36,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 10:00:36,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1676 transitions. [2020-12-09 10:00:36,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2020-12-09 10:00:36,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:00:36,846 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:00:37,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt,8 mathsat -unsat_core_generation=3 [2020-12-09 10:00:37,248 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:00:37,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:00:37,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1496887766, now seen corresponding path program 1 times [2020-12-09 10:00:37,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:00:37,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583265739] [2020-12-09 10:00:37,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 10:00:37,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:00:37,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 10:00:37,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:00:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 83 proven. 177 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 10:00:37,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:00:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 10:00:38,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583265739] [2020-12-09 10:00:38,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 10:00:38,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 10:00:38,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522102093] [2020-12-09 10:00:38,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:00:38,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:00:38,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:00:38,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:00:38,329 INFO L87 Difference]: Start difference. First operand 1394 states and 1676 transitions. Second operand 4 states. [2020-12-09 10:01:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:01:32,597 INFO L93 Difference]: Finished difference Result 3759 states and 4473 transitions. [2020-12-09 10:01:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:01:32,605 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2020-12-09 10:01:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:01:32,613 INFO L225 Difference]: With dead ends: 3759 [2020-12-09 10:01:32,613 INFO L226 Difference]: Without dead ends: 2506 [2020-12-09 10:01:32,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:01:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-12-09 10:01:32,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2228. [2020-12-09 10:01:32,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2020-12-09 10:01:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2583 transitions. [2020-12-09 10:01:32,647 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2583 transitions. Word has length 330 [2020-12-09 10:01:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:01:32,647 INFO L481 AbstractCegarLoop]: Abstraction has 2228 states and 2583 transitions. [2020-12-09 10:01:32,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:01:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2583 transitions. [2020-12-09 10:01:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2020-12-09 10:01:32,651 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:01:32,651 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:01:32,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 10:01:32,853 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:01:32,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:01:32,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2132057286, now seen corresponding path program 1 times [2020-12-09 10:01:32,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 10:01:32,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400019702] [2020-12-09 10:01:32,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-09 10:01:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:01:33,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 10:01:33,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:01:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 60 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:01:33,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:01:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 266 proven. 8 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-12-09 10:01:34,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400019702] [2020-12-09 10:01:34,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [501470182] [2020-12-09 10:01:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt [2020-12-09 10:01:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:01:34,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 10:01:34,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 10:01:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:01:35,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 10:01:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2020-12-09 10:01:35,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2020-12-09 10:01:35,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4, 5] total 10 [2020-12-09 10:01:35,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633734825] [2020-12-09 10:01:35,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:01:35,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 10:01:35,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:01:35,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-09 10:01:35,384 INFO L87 Difference]: Start difference. First operand 2228 states and 2583 transitions. Second operand 3 states. [2020-12-09 10:01:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:01:41,046 INFO L93 Difference]: Finished difference Result 5147 states and 5987 transitions. [2020-12-09 10:01:41,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:01:41,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 343 [2020-12-09 10:01:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:01:41,049 INFO L225 Difference]: With dead ends: 5147 [2020-12-09 10:01:41,049 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 10:01:41,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1368 GetRequests, 1358 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-12-09 10:01:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 10:01:41,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 10:01:41,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 10:01:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 10:01:41,052 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 343 [2020-12-09 10:01:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:01:41,052 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 10:01:41,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:01:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 10:01:41,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 10:01:41,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3,12 cvc4 --incremental --print-success --lang smt [2020-12-09 10:01:41,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 10:01:41,575 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2020-12-09 10:01:42,739 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2020-12-09 10:01:43,804 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2020-12-09 10:01:43,807 INFO L262 CegarLoopResult]: For program point L597(line 597) no Hoare annotation was computed. [2020-12-09 10:01:43,807 INFO L262 CegarLoopResult]: For program point L564(lines 564 582) no Hoare annotation was computed. [2020-12-09 10:01:43,807 INFO L262 CegarLoopResult]: For program point L333(lines 333 582) no Hoare annotation was computed. [2020-12-09 10:01:43,807 INFO L262 CegarLoopResult]: For program point L367(lines 367 582) no Hoare annotation was computed. [2020-12-09 10:01:43,807 INFO L262 CegarLoopResult]: For program point L301(lines 301 582) no Hoare annotation was computed. [2020-12-09 10:01:43,807 INFO L262 CegarLoopResult]: For program point L235(lines 235 582) no Hoare annotation was computed. [2020-12-09 10:01:43,807 INFO L262 CegarLoopResult]: For program point L202-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L169-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L136-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L103-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L70-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L37-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L533(lines 533 582) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L567(lines 567 582) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L435(lines 435 582) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L336(lines 336 582) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L270(lines 270 582) no Hoare annotation was computed. [2020-12-09 10:01:43,808 INFO L262 CegarLoopResult]: For program point L403(lines 403 582) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L370(lines 370 582) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L205-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L172-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L139-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L106-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L73-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L40-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L536(lines 536 582) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L503(lines 503 582) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L470(lines 470 582) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L339(lines 339 582) no Hoare annotation was computed. [2020-12-09 10:01:43,809 INFO L262 CegarLoopResult]: For program point L306(lines 306 582) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L241(lines 241 582) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L208-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L175-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L142-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L109-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L76-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L43-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L539(lines 539 582) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L440(lines 440 582) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L275(lines 275 582) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-09 10:01:43,810 INFO L262 CegarLoopResult]: For program point L573(lines 573 582) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L408(lines 408 582) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L375(lines 375 582) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L475(lines 475 582) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L211-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L178-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L145-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L112-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L79-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L46-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L509(lines 509 582) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L311(lines 311 582) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-09 10:01:43,811 INFO L262 CegarLoopResult]: For program point L345(lines 345 582) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L246(lines 246 582) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L544(lines 544 582) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L181-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L148-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L115-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L82-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L49-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L446(lines 446 582) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L413(lines 413 582) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L380(lines 380 582) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L281(lines 281 582) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L579(lines 579 582) no Hoare annotation was computed. [2020-12-09 10:01:43,812 INFO L262 CegarLoopResult]: For program point L249(lines 249 582) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L514(lines 514 582) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L481(lines 481 582) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L316(lines 316 582) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L184-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L151-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L118-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L85-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L52-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L350(lines 350 582) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-09 10:01:43,813 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L258 CegarLoopResult]: At program point L583(lines 30 584) the Hoare annotation is: (let ((.cse1 (= (_ bv9 32) ~a19~0)) (.cse0 (not (bvsge (_ bv218 32) (bvadd (bvsdiv (bvmul (bvsdiv ~a1~0 (_ bv5 32)) (_ bv5 32)) (_ bv5 32)) (_ bv505228 32)))))) (or (= (_ bv2 32) ~a10~0) (and (= (_ bv1 32) ~a10~0) .cse0) (= (_ bv8 32) ~a19~0) (and .cse1 .cse0) (and .cse1 (= (_ bv0 32) ~a10~0)) (and .cse0 (or (not (bvslt (_ bv38 32) ~a1~0)) (not (bvsge (_ bv218 32) ~a1~0)))))) [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L550(lines 550 582) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L418(lines 418 582) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L385(lines 385 582) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L220(lines 220 582) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L187-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L154-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L121-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L88-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L55-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L452(lines 452 582) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L287(lines 287 582) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L254(lines 254 582) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-09 10:01:43,814 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L519(lines 519 582) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L486(lines 486 582) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L265 CegarLoopResult]: At program point L586(lines 586 602) the Hoare annotation is: true [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L388(lines 388 582) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L355(lines 355 582) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L322(lines 322 582) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L190-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L157-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L124-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L91-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L58-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-09 10:01:43,815 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L555(lines 555 582) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L225(lines 225 582) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L424(lines 424 582) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L259(lines 259 582) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L193-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L160-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L127-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L94-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L61-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L524(lines 524 582) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L491(lines 491 582) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L458(lines 458 582) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L293(lines 293 582) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-09 10:01:43,816 INFO L262 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L558(lines 558 582) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L393(lines 393 582) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L327(lines 327 582) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L258 CegarLoopResult]: At program point L592-2(lines 592 601) the Hoare annotation is: (let ((.cse1 (= (_ bv9 32) ~a19~0)) (.cse0 (not (bvsge (_ bv218 32) (bvadd (bvsdiv (bvmul (bvsdiv ~a1~0 (_ bv5 32)) (_ bv5 32)) (_ bv5 32)) (_ bv505228 32)))))) (or (= (_ bv2 32) ~a10~0) (and (= (_ bv1 32) ~a10~0) .cse0) (= (_ bv8 32) ~a19~0) (and .cse1 .cse0) (and .cse1 (= (_ bv0 32) ~a10~0)) (and .cse0 (or (not (bvslt (_ bv38 32) ~a1~0)) (not (bvsge (_ bv218 32) ~a1~0)))))) [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L361(lines 361 582) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L196-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L163-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L130-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L97-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L64-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L31-2(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L527(lines 527 582) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L296(lines 296 582) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L230(lines 230 582) no Hoare annotation was computed. [2020-12-09 10:01:43,817 INFO L262 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L429(lines 429 582) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L330(lines 330 582) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L264(lines 264 582) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L364(lines 364 582) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L199-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L166-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L133-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L100-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L67-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L34-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 10:01:43,818 INFO L262 CegarLoopResult]: For program point L497(lines 497 582) no Hoare annotation was computed. [2020-12-09 10:01:43,819 INFO L262 CegarLoopResult]: For program point L464(lines 464 582) no Hoare annotation was computed. [2020-12-09 10:01:43,819 INFO L262 CegarLoopResult]: For program point L398(lines 398 582) no Hoare annotation was computed. [2020-12-09 10:01:43,819 INFO L262 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-09 10:01:43,819 INFO L262 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-09 10:01:43,819 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-09 10:01:43,819 INFO L262 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-09 10:01:43,819 INFO L262 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-09 10:01:43,821 INFO L262 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-09 10:01:43,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:01:43 BoogieIcfgContainer [2020-12-09 10:01:43,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 10:01:43,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 10:01:43,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 10:01:43,833 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 10:01:43,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:59:47" (3/4) ... [2020-12-09 10:01:43,835 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 10:01:43,849 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 10:01:43,850 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 10:01:43,851 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 10:01:43,852 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 10:01:43,929 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dfb1fd67-03fe-4cbd-b6b8-101aa072d82d/bin/utaipan/witness.graphml [2020-12-09 10:01:43,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 10:01:43,930 INFO L168 Benchmark]: Toolchain (without parser) took 119454.20 ms. Allocated memory was 56.6 MB in the beginning and 121.6 MB in the end (delta: 65.0 MB). Free memory was 33.9 MB in the beginning and 69.6 MB in the end (delta: -35.7 MB). Peak memory consumption was 28.6 MB. Max. memory is 16.1 GB. [2020-12-09 10:01:43,930 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 56.6 MB. Free memory was 39.2 MB in the beginning and 39.1 MB in the end (delta: 81.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 10:01:43,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.13 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 33.6 MB in the beginning and 48.5 MB in the end (delta: -14.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. [2020-12-09 10:01:43,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.35 ms. Allocated memory is still 69.2 MB. Free memory was 48.5 MB in the beginning and 43.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 10:01:43,931 INFO L168 Benchmark]: Boogie Preprocessor took 46.08 ms. Allocated memory is still 69.2 MB. Free memory was 43.1 MB in the beginning and 38.5 MB in the end (delta: 4.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 10:01:43,931 INFO L168 Benchmark]: RCFGBuilder took 2049.03 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 38.5 MB in the beginning and 57.9 MB in the end (delta: -19.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. [2020-12-09 10:01:43,931 INFO L168 Benchmark]: TraceAbstraction took 116819.41 ms. Allocated memory was 83.9 MB in the beginning and 121.6 MB in the end (delta: 37.7 MB). Free memory was 57.4 MB in the beginning and 84.6 MB in the end (delta: -27.2 MB). Peak memory consumption was 69.4 MB. Max. memory is 16.1 GB. [2020-12-09 10:01:43,931 INFO L168 Benchmark]: Witness Printer took 95.94 ms. Allocated memory is still 121.6 MB. Free memory was 84.6 MB in the beginning and 69.6 MB in the end (delta: 14.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 10:01:43,933 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.16 ms. Allocated memory is still 56.6 MB. Free memory was 39.2 MB in the beginning and 39.1 MB in the end (delta: 81.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 386.13 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 33.6 MB in the beginning and 48.5 MB in the end (delta: -14.9 MB). Peak memory consumption was 14.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.35 ms. Allocated memory is still 69.2 MB. Free memory was 48.5 MB in the beginning and 43.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 46.08 ms. Allocated memory is still 69.2 MB. Free memory was 43.1 MB in the beginning and 38.5 MB in the end (delta: 4.6 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2049.03 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 38.5 MB in the beginning and 57.9 MB in the end (delta: -19.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 116819.41 ms. Allocated memory was 83.9 MB in the beginning and 121.6 MB in the end (delta: 37.7 MB). Free memory was 57.4 MB in the beginning and 84.6 MB in the end (delta: -27.2 MB). Peak memory consumption was 69.4 MB. Max. memory is 16.1 GB. * Witness Printer took 95.94 ms. Allocated memory is still 121.6 MB. Free memory was 84.6 MB in the beginning and 69.6 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: 104]: 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: ((((2bv32 == a10 || (1bv32 == a10 && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)))) || 8bv32 == a19) || (9bv32 == a19 && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)))) || (9bv32 == a19 && 0bv32 == a10)) || (!~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)) && (!~bvslt32(38bv32, a1) || !~bvsge32(218bv32, a1))) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((2bv32 == a10 || (1bv32 == a10 && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)))) || 8bv32 == a19) || (9bv32 == a19 && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)))) || (9bv32 == a19 && 0bv32 == a10)) || (!~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)) && (!~bvslt32(38bv32, a1) || !~bvsge32(218bv32, a1))) - 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: 114.4s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 103.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 675 SDtfs, 1380 SDslu, 70 SDs, 0 SdLazy, 4350 SolverSat, 926 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 95.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3621 GetRequests, 3586 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2228occurred in iteration=8, 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, 9 MinimizatonAttempts, 834 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 61 NumberOfFragments, 137 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1910 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 190 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2236 NumberOfCodeBlocks, 2236 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3619 ConstructedInterpolants, 0 QuantifiedInterpolants, 5355868 SizeOfPredicates, 23 NumberOfNonLiveVariables, 2840 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 1691/2824 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...