./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label37.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_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label37.c -s /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 019cfc0f5e1dac32eb6ff0e55ff4699e9eba8503 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label37.c -s /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 019cfc0f5e1dac32eb6ff0e55ff4699e9eba8503 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 15:49:07,277 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 15:49:07,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 15:49:07,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 15:49:07,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 15:49:07,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 15:49:07,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 15:49:07,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 15:49:07,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 15:49:07,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 15:49:07,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 15:49:07,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 15:49:07,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 15:49:07,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 15:49:07,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 15:49:07,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 15:49:07,321 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 15:49:07,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 15:49:07,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 15:49:07,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 15:49:07,327 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 15:49:07,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 15:49:07,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 15:49:07,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 15:49:07,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 15:49:07,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 15:49:07,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 15:49:07,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 15:49:07,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 15:49:07,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 15:49:07,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 15:49:07,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 15:49:07,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 15:49:07,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 15:49:07,337 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 15:49:07,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 15:49:07,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 15:49:07,338 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 15:49:07,338 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 15:49:07,339 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 15:49:07,339 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 15:49:07,340 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 15:49:07,356 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 15:49:07,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 15:49:07,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 15:49:07,357 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 15:49:07,357 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 15:49:07,357 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 15:49:07,357 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 15:49:07,357 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 15:49:07,357 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 15:49:07,357 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 15:49:07,358 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 15:49:07,358 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 15:49:07,358 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 15:49:07,358 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 15:49:07,358 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 15:49:07,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 15:49:07,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 15:49:07,360 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 15:49:07,360 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 15:49:07,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 15:49:07,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 15:49:07,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 15:49:07,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 15:49:07,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 15:49:07,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 15:49:07,360 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 15:49:07,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 15:49:07,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 15:49:07,361 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 15:49:07,361 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 15:49:07,361 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_aa09c127-2bec-4a57-b948-92d154ee26bf/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_aa09c127-2bec-4a57-b948-92d154ee26bf/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 -> 019cfc0f5e1dac32eb6ff0e55ff4699e9eba8503 [2020-12-09 15:49:07,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 15:49:07,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 15:49:07,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 15:49:07,557 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 15:49:07,557 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 15:49:07,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label37.c [2020-12-09 15:49:07,598 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data/061ff3203/661046b3699e4acbbc85981ff4e8fe10/FLAGacbe7b669 [2020-12-09 15:49:08,026 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 15:49:08,027 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/sv-benchmarks/c/eca-rers2012/Problem10_label37.c [2020-12-09 15:49:08,035 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data/061ff3203/661046b3699e4acbbc85981ff4e8fe10/FLAGacbe7b669 [2020-12-09 15:49:08,045 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data/061ff3203/661046b3699e4acbbc85981ff4e8fe10 [2020-12-09 15:49:08,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 15:49:08,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 15:49:08,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 15:49:08,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 15:49:08,052 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 15:49:08,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4653ea0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08, skipping insertion in model container [2020-12-09 15:49:08,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 15:49:08,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 15:49:08,223 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_aa09c127-2bec-4a57-b948-92d154ee26bf/sv-benchmarks/c/eca-rers2012/Problem10_label37.c[6216,6229] [2020-12-09 15:49:08,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 15:49:08,326 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 15:49:08,348 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_aa09c127-2bec-4a57-b948-92d154ee26bf/sv-benchmarks/c/eca-rers2012/Problem10_label37.c[6216,6229] [2020-12-09 15:49:08,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 15:49:08,401 INFO L208 MainTranslator]: Completed translation [2020-12-09 15:49:08,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08 WrapperNode [2020-12-09 15:49:08,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 15:49:08,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 15:49:08,403 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 15:49:08,403 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 15:49:08,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 15:49:08,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 15:49:08,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 15:49:08,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 15:49:08,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... [2020-12-09 15:49:08,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 15:49:08,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 15:49:08,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 15:49:08,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 15:49:08,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:49:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 15:49:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 15:49:08,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 15:49:08,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 15:49:14,371 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 15:49:14,372 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 15:49:14,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:49:14 BoogieIcfgContainer [2020-12-09 15:49:14,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 15:49:14,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 15:49:14,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 15:49:14,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 15:49:14,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:49:08" (1/3) ... [2020-12-09 15:49:14,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2c896c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:49:14, skipping insertion in model container [2020-12-09 15:49:14,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:49:08" (2/3) ... [2020-12-09 15:49:14,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2c896c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:49:14, skipping insertion in model container [2020-12-09 15:49:14,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:49:14" (3/3) ... [2020-12-09 15:49:14,379 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label37.c [2020-12-09 15:49:14,388 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 15:49:14,391 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 15:49:14,398 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 15:49:14,414 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 15:49:14,414 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 15:49:14,414 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 15:49:14,414 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 15:49:14,414 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 15:49:14,414 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 15:49:14,414 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 15:49:14,414 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 15:49:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 15:49:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 15:49:14,426 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:49:14,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 15:49:14,426 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:49:14,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:49:14,430 INFO L82 PathProgramCache]: Analyzing trace with hash 857616986, now seen corresponding path program 1 times [2020-12-09 15:49:14,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:49:14,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503338310] [2020-12-09 15:49:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:49:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:49:14,593 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 15:49:14,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503338310] [2020-12-09 15:49:14,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:49:14,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 15:49:14,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349886136] [2020-12-09 15:49:14,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 15:49:14,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 15:49:14,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 15:49:14,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:49:14,636 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-09 15:49:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:49:14,691 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 15:49:14,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 15:49:14,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 15:49:14,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:49:14,697 INFO L225 Difference]: With dead ends: 23 [2020-12-09 15:49:14,698 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 15:49:14,699 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 15:49:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 15:49:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 15:49:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 15:49:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 15:49:14,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 15:49:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:49:14,721 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 15:49:14,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 15:49:14,722 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 15:49:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 15:49:14,722 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:49:14,722 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 15:49:14,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 15:49:14,722 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:49:14,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:49:14,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1861964764, now seen corresponding path program 1 times [2020-12-09 15:49:14,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 15:49:14,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724617008] [2020-12-09 15:49:14,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 15:49:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:49:14,929 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 15:49:14,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724617008] [2020-12-09 15:49:14,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345483448] [2020-12-09 15:49:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:49:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:49:15,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 15:49:15,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:49:15,224 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 1003 DAG size of output: 128 [2020-12-09 15:49:15,262 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 3, 2, 3, 2, 3, 2, 3, 2, 3, 1] term [2020-12-09 15:49:15,262 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 15:49:15,265 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 15:49:15,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 15:49:15,410 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 15:49:15,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:49:15,592 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 1666 DAG size of output: 906 [2020-12-09 15:49:15,626 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 15:49:15,626 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,631 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 15:49:15,631 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,635 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 15:49:15,635 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,638 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 15:49:15,639 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,642 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 15:49:15,642 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,645 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 15:49:15,645 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,648 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 15:49:15,648 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,651 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 15:49:15,652 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,654 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 15:49:15,654 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,657 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 15:49:15,657 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,679 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 15:49:15,680 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,682 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 15:49:15,682 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,685 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 15:49:15,685 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,688 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 15:49:15,688 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,691 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 15:49:15,691 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,694 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 15:49:15,694 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,695 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,695 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,696 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,696 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,697 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,697 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,699 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,699 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,700 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,700 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,703 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 15:49:15,704 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,706 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 15:49:15,706 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,708 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 15:49:15,709 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,711 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 15:49:15,711 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,712 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,712 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,714 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 15:49:15,714 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,716 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 15:49:15,717 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,718 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 15:49:15,719 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,720 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 15:49:15,721 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,721 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,721 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,723 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 15:49:15,724 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,724 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,725 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,726 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 15:49:15,727 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,729 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 15:49:15,729 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,730 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 15:49:15,731 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,732 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 15:49:15,732 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,733 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 15:49:15,733 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,734 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 15:49:15,734 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,735 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,735 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,737 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 15:49:15,737 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,738 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 15:49:15,738 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,739 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,739 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,741 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 15:49:15,741 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,741 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,742 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,744 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,744 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,744 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,745 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,745 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,745 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,746 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,747 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,747 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,747 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,749 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,749 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,749 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,749 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,750 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,750 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,751 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,751 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,752 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,752 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,753 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,753 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,754 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,754 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,755 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,755 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,757 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,757 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,759 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,759 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,761 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,761 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,762 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,763 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,763 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,763 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,764 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,764 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,765 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,765 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,767 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,767 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,768 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,768 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,768 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,768 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,769 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,769 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,770 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,770 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,771 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,771 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,772 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,772 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,773 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,773 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,773 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,774 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,774 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,774 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,775 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,775 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,776 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,776 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,777 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 15:49:15,777 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,778 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,778 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,778 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,779 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,780 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,780 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,781 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,781 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,782 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,782 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,783 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,783 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,784 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,784 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,785 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 15:49:15,785 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,786 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,786 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,787 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,787 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,787 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 15:49:15,788 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,791 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 15:49:15,791 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,794 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 15:49:15,794 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,796 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 15:49:15,796 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,798 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 15:49:15,799 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,801 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 15:49:15,801 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,803 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 15:49:15,804 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,806 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 15:49:15,806 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,808 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 15:49:15,808 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,810 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 15:49:15,810 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,813 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 15:49:15,813 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,815 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 15:49:15,815 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,817 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 15:49:15,817 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,818 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 15:49:15,819 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,820 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 15:49:15,820 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,822 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 15:49:15,822 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,824 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 15:49:15,824 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,826 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 15:49:15,827 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,828 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 15:49:15,829 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,830 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 15:49:15,831 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,832 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 15:49:15,833 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,834 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 15:49:15,834 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,836 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 15:49:15,836 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,837 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 15:49:15,838 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,839 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 15:49:15,839 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,841 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 15:49:15,841 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,842 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 15:49:15,842 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,843 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 15:49:15,843 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,844 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 15:49:15,844 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,845 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 15:49:15,845 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,846 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 15:49:15,846 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,847 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 15:49:15,847 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,848 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 8, 7, 2, 1] term [2020-12-09 15:49:15,848 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:15,848 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 15:49:15,849 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 15:49:16,963 WARN L197 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 87 [2020-12-09 15:49:17,434 WARN L197 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 84 [2020-12-09 15:49:17,440 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 6, 5, 7, 5, 7, 5, 1] term [2020-12-09 15:49:17,440 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 15:49:17,635 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 53 [2020-12-09 15:49:17,636 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 15:49:17,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1044244682] [2020-12-09 15:49:17,651 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 15:49:17,651 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 15:49:17,654 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 15:49:17,658 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 15:49:17,658 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 15:49:17,789 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 49 [2020-12-09 15:49:18,303 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 49 [2020-12-09 15:49:19,008 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 1669 DAG size of output: 1584 [2020-12-09 15:58:09,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 15:58:09,292 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 15:58:09,302 INFO L168 Benchmark]: Toolchain (without parser) took 541251.24 ms. Allocated memory was 98.6 MB in the beginning and 973.1 MB in the end (delta: 874.5 MB). Free memory was 66.1 MB in the beginning and 382.7 MB in the end (delta: -316.6 MB). Peak memory consumption was 651.1 MB. Max. memory is 16.1 GB. [2020-12-09 15:58:09,303 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 98.6 MB. Free memory is still 75.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 15:58:09,305 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.75 ms. Allocated memory is still 98.6 MB. Free memory was 65.8 MB in the beginning and 62.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. [2020-12-09 15:58:09,307 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.74 ms. Allocated memory is still 98.6 MB. Free memory was 62.8 MB in the beginning and 55.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 15:58:09,308 INFO L168 Benchmark]: Boogie Preprocessor took 54.22 ms. Allocated memory is still 98.6 MB. Free memory was 54.7 MB in the beginning and 49.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 15:58:09,311 INFO L168 Benchmark]: RCFGBuilder took 5857.03 ms. Allocated memory was 98.6 MB in the beginning and 247.5 MB in the end (delta: 148.9 MB). Free memory was 49.7 MB in the beginning and 70.8 MB in the end (delta: -21.1 MB). Peak memory consumption was 145.0 MB. Max. memory is 16.1 GB. [2020-12-09 15:58:09,313 INFO L168 Benchmark]: TraceAbstraction took 534924.17 ms. Allocated memory was 247.5 MB in the beginning and 973.1 MB in the end (delta: 725.6 MB). Free memory was 70.8 MB in the beginning and 382.7 MB in the end (delta: -311.8 MB). Peak memory consumption was 505.0 MB. Max. memory is 16.1 GB. [2020-12-09 15:58:09,322 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 98.6 MB. Free memory is still 75.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 352.75 ms. Allocated memory is still 98.6 MB. Free memory was 65.8 MB in the beginning and 62.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 58.74 ms. Allocated memory is still 98.6 MB. Free memory was 62.8 MB in the beginning and 55.1 MB in the end (delta: 7.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.22 ms. Allocated memory is still 98.6 MB. Free memory was 54.7 MB in the beginning and 49.7 MB in the end (delta: 5.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5857.03 ms. Allocated memory was 98.6 MB in the beginning and 247.5 MB in the end (delta: 148.9 MB). Free memory was 49.7 MB in the beginning and 70.8 MB in the end (delta: -21.1 MB). Peak memory consumption was 145.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 534924.17 ms. Allocated memory was 247.5 MB in the beginning and 973.1 MB in the end (delta: 725.6 MB). Free memory was 70.8 MB in the beginning and 382.7 MB in the end (delta: -311.8 MB). Peak memory consumption was 505.0 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 15:58:10,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 15:58:10,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 15:58:10,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 15:58:10,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 15:58:10,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 15:58:10,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 15:58:10,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 15:58:10,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 15:58:10,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 15:58:10,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 15:58:10,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 15:58:10,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 15:58:10,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 15:58:10,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 15:58:10,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 15:58:10,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 15:58:10,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 15:58:10,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 15:58:10,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 15:58:10,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 15:58:10,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 15:58:10,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 15:58:10,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 15:58:10,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 15:58:10,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 15:58:10,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 15:58:10,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 15:58:10,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 15:58:10,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 15:58:10,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 15:58:10,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 15:58:10,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 15:58:10,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 15:58:10,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 15:58:10,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 15:58:10,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 15:58:10,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 15:58:10,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 15:58:10,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 15:58:10,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 15:58:10,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 15:58:10,956 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 15:58:10,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 15:58:10,957 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 15:58:10,957 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 15:58:10,957 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 15:58:10,957 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 15:58:10,957 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 15:58:10,957 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 15:58:10,957 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 15:58:10,958 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 15:58:10,958 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 15:58:10,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 15:58:10,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 15:58:10,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 15:58:10,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 15:58:10,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 15:58:10,959 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 15:58:10,959 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 15:58:10,960 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 15:58:10,960 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 15:58:10,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 15:58:10,960 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 15:58:10,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 15:58:10,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 15:58:10,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 15:58:10,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 15:58:10,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 15:58:10,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 15:58:10,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 15:58:10,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 15:58:10,961 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 15:58:10,961 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 15:58:10,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 15:58:10,961 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 15:58:10,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 15:58:10,962 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_aa09c127-2bec-4a57-b948-92d154ee26bf/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_aa09c127-2bec-4a57-b948-92d154ee26bf/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 -> 019cfc0f5e1dac32eb6ff0e55ff4699e9eba8503 [2020-12-09 15:58:11,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 15:58:11,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 15:58:11,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 15:58:11,213 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 15:58:11,213 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 15:58:11,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label37.c [2020-12-09 15:58:11,260 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data/ab4afb3a2/df31a7c7c71742c2a2df24c36fabfa88/FLAGdab26de9d [2020-12-09 15:58:11,701 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 15:58:11,702 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/sv-benchmarks/c/eca-rers2012/Problem10_label37.c [2020-12-09 15:58:11,713 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data/ab4afb3a2/df31a7c7c71742c2a2df24c36fabfa88/FLAGdab26de9d [2020-12-09 15:58:11,723 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/data/ab4afb3a2/df31a7c7c71742c2a2df24c36fabfa88 [2020-12-09 15:58:11,724 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 15:58:11,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 15:58:11,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 15:58:11,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 15:58:11,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 15:58:11,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:58:11" (1/1) ... [2020-12-09 15:58:11,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1fe475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:11, skipping insertion in model container [2020-12-09 15:58:11,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:58:11" (1/1) ... [2020-12-09 15:58:11,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 15:58:11,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 15:58:11,923 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_aa09c127-2bec-4a57-b948-92d154ee26bf/sv-benchmarks/c/eca-rers2012/Problem10_label37.c[6216,6229] [2020-12-09 15:58:12,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 15:58:12,059 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 15:58:12,087 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_aa09c127-2bec-4a57-b948-92d154ee26bf/sv-benchmarks/c/eca-rers2012/Problem10_label37.c[6216,6229] [2020-12-09 15:58:12,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 15:58:12,174 INFO L208 MainTranslator]: Completed translation [2020-12-09 15:58:12,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12 WrapperNode [2020-12-09 15:58:12,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 15:58:12,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 15:58:12,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 15:58:12,176 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 15:58:12,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... [2020-12-09 15:58:12,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... [2020-12-09 15:58:12,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 15:58:12,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 15:58:12,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 15:58:12,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 15:58:12,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... [2020-12-09 15:58:12,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... [2020-12-09 15:58:12,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... [2020-12-09 15:58:12,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... [2020-12-09 15:58:12,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... [2020-12-09 15:58:12,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... [2020-12-09 15:58:12,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... [2020-12-09 15:58:12,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 15:58:12,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 15:58:12,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 15:58:12,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 15:58:12,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:58:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 15:58:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 15:58:12,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 15:58:12,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 15:58:14,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 15:58:14,336 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 15:58:14,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:58:14 BoogieIcfgContainer [2020-12-09 15:58:14,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 15:58:14,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 15:58:14,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 15:58:14,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 15:58:14,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:58:11" (1/3) ... [2020-12-09 15:58:14,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393ea6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:58:14, skipping insertion in model container [2020-12-09 15:58:14,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:58:12" (2/3) ... [2020-12-09 15:58:14,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393ea6f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:58:14, skipping insertion in model container [2020-12-09 15:58:14,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:58:14" (3/3) ... [2020-12-09 15:58:14,343 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label37.c [2020-12-09 15:58:14,352 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 15:58:14,355 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 15:58:14,361 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 15:58:14,378 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 15:58:14,378 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 15:58:14,378 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 15:58:14,378 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 15:58:14,378 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 15:58:14,378 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 15:58:14,378 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 15:58:14,379 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 15:58:14,390 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-12-09 15:58:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-09 15:58:14,396 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:58:14,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 15:58:14,396 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:58:14,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:58:14,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1425694346, now seen corresponding path program 1 times [2020-12-09 15:58:14,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 15:58:14,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74072454] [2020-12-09 15:58:14,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:58:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:58:14,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 15:58:14,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:58:14,596 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 15:58:14,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 15:58:14,597 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74072454] [2020-12-09 15:58:14,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:58:14,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 15:58:14,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177223972] [2020-12-09 15:58:14,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 15:58:14,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 15:58:14,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 15:58:14,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:58:14,617 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2020-12-09 15:58:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:58:17,456 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2020-12-09 15:58:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 15:58:17,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2020-12-09 15:58:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:58:17,471 INFO L225 Difference]: With dead ends: 552 [2020-12-09 15:58:17,471 INFO L226 Difference]: Without dead ends: 282 [2020-12-09 15:58:17,474 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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 15:58:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-09 15:58:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-12-09 15:58:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-09 15:58:17,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 377 transitions. [2020-12-09 15:58:17,514 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 377 transitions. Word has length 54 [2020-12-09 15:58:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:58:17,514 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 377 transitions. [2020-12-09 15:58:17,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 15:58:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 377 transitions. [2020-12-09 15:58:17,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-12-09 15:58:17,518 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:58:17,518 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 15:58:17,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 15:58:17,720 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:58:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:58:17,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1173091382, now seen corresponding path program 1 times [2020-12-09 15:58:17,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 15:58:17,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239810573] [2020-12-09 15:58:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:58:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:58:17,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 15:58:17,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:58:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:58:17,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 15:58:17,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239810573] [2020-12-09 15:58:17,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:58:17,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 15:58:17,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482858127] [2020-12-09 15:58:17,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 15:58:17,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 15:58:17,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 15:58:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:58:17,913 INFO L87 Difference]: Start difference. First operand 282 states and 377 transitions. Second operand 3 states. [2020-12-09 15:58:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:58:20,694 INFO L93 Difference]: Finished difference Result 701 states and 967 transitions. [2020-12-09 15:58:20,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 15:58:20,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2020-12-09 15:58:20,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:58:20,698 INFO L225 Difference]: With dead ends: 701 [2020-12-09 15:58:20,698 INFO L226 Difference]: Without dead ends: 421 [2020-12-09 15:58:20,699 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 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 15:58:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-12-09 15:58:20,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-12-09 15:58:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-12-09 15:58:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 526 transitions. [2020-12-09 15:58:20,717 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 526 transitions. Word has length 120 [2020-12-09 15:58:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:58:20,718 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 526 transitions. [2020-12-09 15:58:20,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 15:58:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 526 transitions. [2020-12-09 15:58:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2020-12-09 15:58:20,720 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:58:20,720 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 15:58:20,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 15:58:20,922 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:58:20,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:58:20,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1604045257, now seen corresponding path program 1 times [2020-12-09 15:58:20,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 15:58:20,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39257091] [2020-12-09 15:58:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:58:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:58:21,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 15:58:21,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:58:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:58:21,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 15:58:21,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39257091] [2020-12-09 15:58:21,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:58:21,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 15:58:21,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300840946] [2020-12-09 15:58:21,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 15:58:21,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 15:58:21,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 15:58:21,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:58:21,208 INFO L87 Difference]: Start difference. First operand 421 states and 526 transitions. Second operand 3 states. [2020-12-09 15:58:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:58:23,304 INFO L93 Difference]: Finished difference Result 979 states and 1209 transitions. [2020-12-09 15:58:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 15:58:23,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2020-12-09 15:58:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:58:23,310 INFO L225 Difference]: With dead ends: 979 [2020-12-09 15:58:23,310 INFO L226 Difference]: Without dead ends: 560 [2020-12-09 15:58:23,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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 15:58:23,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-12-09 15:58:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-12-09 15:58:23,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 15:58:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 675 transitions. [2020-12-09 15:58:23,326 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 675 transitions. Word has length 127 [2020-12-09 15:58:23,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:58:23,327 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 675 transitions. [2020-12-09 15:58:23,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 15:58:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 675 transitions. [2020-12-09 15:58:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2020-12-09 15:58:23,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:58:23,329 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 15:58:23,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 15:58:23,531 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:58:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:58:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash 624573956, now seen corresponding path program 1 times [2020-12-09 15:58:23,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 15:58:23,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908423323] [2020-12-09 15:58:23,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:58:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:58:23,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 15:58:23,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:58:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:58:23,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:58:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:58:24,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908423323] [2020-12-09 15:58:24,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 15:58:24,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 15:58:24,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76667804] [2020-12-09 15:58:24,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 15:58:24,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 15:58:24,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 15:58:24,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 15:58:24,007 INFO L87 Difference]: Start difference. First operand 560 states and 675 transitions. Second operand 4 states. [2020-12-09 15:58:52,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:58:52,818 INFO L93 Difference]: Finished difference Result 1415 states and 1741 transitions. [2020-12-09 15:58:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 15:58:52,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2020-12-09 15:58:52,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:58:52,825 INFO L225 Difference]: With dead ends: 1415 [2020-12-09 15:58:52,825 INFO L226 Difference]: Without dead ends: 977 [2020-12-09 15:58:52,826 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 252 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 15:58:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2020-12-09 15:58:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 560. [2020-12-09 15:58:52,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 15:58:52,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 672 transitions. [2020-12-09 15:58:52,837 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 672 transitions. Word has length 129 [2020-12-09 15:58:52,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:58:52,838 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 672 transitions. [2020-12-09 15:58:52,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 15:58:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 672 transitions. [2020-12-09 15:58:52,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-09 15:58:52,840 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:58:52,840 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-12-09 15:58:53,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 15:58:53,042 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:58:53,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:58:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1803096100, now seen corresponding path program 1 times [2020-12-09 15:58:53,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 15:58:53,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634763565] [2020-12-09 15:58:53,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:58:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:58:53,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 15:58:53,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:58:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:58:53,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 15:58:53,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634763565] [2020-12-09 15:58:53,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:58:53,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 15:58:53,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631629821] [2020-12-09 15:58:53,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 15:58:53,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 15:58:53,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 15:58:53,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:58:53,266 INFO L87 Difference]: Start difference. First operand 560 states and 672 transitions. Second operand 3 states. [2020-12-09 15:58:55,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:58:55,883 INFO L93 Difference]: Finished difference Result 1396 states and 1715 transitions. [2020-12-09 15:58:55,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 15:58:55,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-09 15:58:55,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:58:55,888 INFO L225 Difference]: With dead ends: 1396 [2020-12-09 15:58:55,888 INFO L226 Difference]: Without dead ends: 977 [2020-12-09 15:58:55,888 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 143 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 15:58:55,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2020-12-09 15:58:55,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 838. [2020-12-09 15:58:55,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-09 15:58:55,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1003 transitions. [2020-12-09 15:58:55,900 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1003 transitions. Word has length 145 [2020-12-09 15:58:55,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:58:55,901 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1003 transitions. [2020-12-09 15:58:55,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 15:58:55,901 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1003 transitions. [2020-12-09 15:58:55,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2020-12-09 15:58:55,903 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:58:55,903 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:56,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 15:58:56,105 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:58:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:58:56,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1488900401, now seen corresponding path program 1 times [2020-12-09 15:58:56,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 15:58:56,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814285622] [2020-12-09 15:58:56,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:58:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:58:56,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 15:58:56,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:58:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2020-12-09 15:58:56,381 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 15:58:56,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814285622] [2020-12-09 15:58:56,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 15:58:56,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 15:58:56,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206377540] [2020-12-09 15:58:56,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 15:58:56,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 15:58:56,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 15:58:56,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 15:58:56,383 INFO L87 Difference]: Start difference. First operand 838 states and 1003 transitions. Second operand 3 states. [2020-12-09 15:58:58,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:58:58,834 INFO L93 Difference]: Finished difference Result 1813 states and 2263 transitions. [2020-12-09 15:58:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 15:58:58,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2020-12-09 15:58:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:58:58,839 INFO L225 Difference]: With dead ends: 1813 [2020-12-09 15:58:58,839 INFO L226 Difference]: Without dead ends: 1116 [2020-12-09 15:58:58,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 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 15:58:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-12-09 15:58:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2020-12-09 15:58:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2020-12-09 15:58:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1331 transitions. [2020-12-09 15:58:58,858 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1331 transitions. Word has length 233 [2020-12-09 15:58:58,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:58:58,858 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1331 transitions. [2020-12-09 15:58:58,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 15:58:58,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1331 transitions. [2020-12-09 15:58:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2020-12-09 15:58:58,861 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:58:58,862 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:58:59,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 15:58:59,062 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:58:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:58:59,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1572441481, now seen corresponding path program 1 times [2020-12-09 15:58:59,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 15:58:59,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694867620] [2020-12-09 15:58:59,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:58:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:58:59,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 15:58:59,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:58:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 72 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:58:59,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:59:00,893 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-12-09 15:59:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 72 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 15:59:01,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694867620] [2020-12-09 15:59:01,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1106271578] [2020-12-09 15:59:01,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:59:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:59:01,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 15:59:01,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:59:02,106 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 15:59:02,107 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 15:59:02,108 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 15:59:02,117 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 15:59:02,118 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 15:59:02,122 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 15:59:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-12-09 15:59:02,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 15:59:02,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 15:59:02,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 4] total 13 [2020-12-09 15:59:02,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804815323] [2020-12-09 15:59:02,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 15:59:02,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 15:59:02,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 15:59:02,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-12-09 15:59:02,374 INFO L87 Difference]: Start difference. First operand 1116 states and 1331 transitions. Second operand 7 states. [2020-12-09 15:59:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 15:59:06,565 INFO L93 Difference]: Finished difference Result 2811 states and 3465 transitions. [2020-12-09 15:59:06,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-09 15:59:06,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 302 [2020-12-09 15:59:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 15:59:06,570 INFO L225 Difference]: With dead ends: 2811 [2020-12-09 15:59:06,570 INFO L226 Difference]: Without dead ends: 1394 [2020-12-09 15:59:06,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 893 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-12-09 15:59:06,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-12-09 15:59:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1394. [2020-12-09 15:59:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2020-12-09 15:59:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1676 transitions. [2020-12-09 15:59:06,589 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1676 transitions. Word has length 302 [2020-12-09 15:59:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 15:59:06,590 INFO L481 AbstractCegarLoop]: Abstraction has 1394 states and 1676 transitions. [2020-12-09 15:59:06,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 15:59:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1676 transitions. [2020-12-09 15:59:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2020-12-09 15:59:06,594 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 15:59:06,595 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, 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, 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 15:59:06,996 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 15:59:06,997 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 15:59:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 15:59:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash 580459146, now seen corresponding path program 1 times [2020-12-09 15:59:07,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 15:59:07,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986898430] [2020-12-09 15:59:07,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 15:59:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 15:59:07,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-09 15:59:07,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 15:59:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 155 proven. 177 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 15:59:07,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 15:59:07,876 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-09 15:59:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2020-12-09 15:59:08,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986898430] [2020-12-09 15:59:08,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 15:59:08,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2020-12-09 15:59:08,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991022303] [2020-12-09 15:59:08,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 15:59:08,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 15:59:08,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 15:59:08,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-09 15:59:08,103 INFO L87 Difference]: Start difference. First operand 1394 states and 1676 transitions. Second operand 4 states. [2020-12-09 16:00:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:00:01,956 INFO L93 Difference]: Finished difference Result 3759 states and 4473 transitions. [2020-12-09 16:00:01,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 16:00:01,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 354 [2020-12-09 16:00:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:00:01,976 INFO L225 Difference]: With dead ends: 3759 [2020-12-09 16:00:01,976 INFO L226 Difference]: Without dead ends: 2506 [2020-12-09 16:00:01,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 702 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 16:00:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-12-09 16:00:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2228. [2020-12-09 16:00:02,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2228 states. [2020-12-09 16:00:02,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2583 transitions. [2020-12-09 16:00:02,004 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2583 transitions. Word has length 354 [2020-12-09 16:00:02,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:00:02,005 INFO L481 AbstractCegarLoop]: Abstraction has 2228 states and 2583 transitions. [2020-12-09 16:00:02,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 16:00:02,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2583 transitions. [2020-12-09 16:00:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2020-12-09 16:00:02,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 16:00:02,009 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, 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, 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 16:00:02,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-09 16:00:02,209 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 16:00:02,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 16:00:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1045973722, now seen corresponding path program 1 times [2020-12-09 16:00:02,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 16:00:02,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557006542] [2020-12-09 16:00:02,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 16:00:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:00:02,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-09 16:00:02,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:00:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 132 proven. 294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 16:00:02,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 16:00:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 338 proven. 8 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-12-09 16:00:03,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557006542] [2020-12-09 16:00:03,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [149843385] [2020-12-09 16:00:03,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/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 16:00:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 16:00:03,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 16:00:03,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 16:00:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2020-12-09 16:00:04,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 16:00:04,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2020-12-09 16:00:04,456 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 4] total 12 [2020-12-09 16:00:04,456 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538187109] [2020-12-09 16:00:04,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 16:00:04,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 16:00:04,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 16:00:04,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-09 16:00:04,457 INFO L87 Difference]: Start difference. First operand 2228 states and 2583 transitions. Second operand 6 states. [2020-12-09 16:00:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 16:00:08,404 INFO L93 Difference]: Finished difference Result 4483 states and 5207 transitions. [2020-12-09 16:00:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 16:00:08,407 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 367 [2020-12-09 16:00:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 16:00:08,407 INFO L225 Difference]: With dead ends: 4483 [2020-12-09 16:00:08,408 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 16:00:08,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1100 GetRequests, 1088 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-12-09 16:00:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 16:00:08,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 16:00:08,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 16:00:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 16:00:08,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 367 [2020-12-09 16:00:08,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 16:00:08,411 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 16:00:08,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 16:00:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 16:00:08,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 16:00:08,812 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 16:00:08,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 16:00:10,453 WARN L197 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-12-09 16:00:11,826 WARN L197 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 47 DAG size of output: 30 [2020-12-09 16:00:11,829 INFO L262 CegarLoopResult]: For program point L597(line 597) no Hoare annotation was computed. [2020-12-09 16:00:11,829 INFO L262 CegarLoopResult]: For program point L564(lines 564 582) no Hoare annotation was computed. [2020-12-09 16:00:11,829 INFO L262 CegarLoopResult]: For program point L333(lines 333 582) no Hoare annotation was computed. [2020-12-09 16:00:11,829 INFO L262 CegarLoopResult]: For program point L367(lines 367 582) no Hoare annotation was computed. [2020-12-09 16:00:11,829 INFO L262 CegarLoopResult]: For program point L301(lines 301 582) no Hoare annotation was computed. [2020-12-09 16:00:11,829 INFO L262 CegarLoopResult]: For program point L235(lines 235 582) no Hoare annotation was computed. [2020-12-09 16:00:11,829 INFO L262 CegarLoopResult]: For program point L202-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,829 INFO L262 CegarLoopResult]: For program point L169-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,829 INFO L262 CegarLoopResult]: For program point L136-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L103-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L70-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L37-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L533(lines 533 582) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L567(lines 567 582) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L435(lines 435 582) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L336(lines 336 582) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L270(lines 270 582) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L403(lines 403 582) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L370(lines 370 582) no Hoare annotation was computed. [2020-12-09 16:00:11,830 INFO L262 CegarLoopResult]: For program point L205-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L172-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L139-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L106-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L73-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L40-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L536(lines 536 582) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L503(lines 503 582) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L470(lines 470 582) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L339(lines 339 582) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L306(lines 306 582) no Hoare annotation was computed. [2020-12-09 16:00:11,831 INFO L262 CegarLoopResult]: For program point L241(lines 241 582) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L208-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L175-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L142-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L109-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L76-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L43-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L539(lines 539 582) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L440(lines 440 582) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L275(lines 275 582) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L573(lines 573 582) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L408(lines 408 582) no Hoare annotation was computed. [2020-12-09 16:00:11,832 INFO L262 CegarLoopResult]: For program point L375(lines 375 582) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L475(lines 475 582) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L211-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L178-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L145-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L112-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L79-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L46-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L509(lines 509 582) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L311(lines 311 582) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L345(lines 345 582) no Hoare annotation was computed. [2020-12-09 16:00:11,833 INFO L262 CegarLoopResult]: For program point L246(lines 246 582) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L544(lines 544 582) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L181-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L148-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L115-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L82-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L49-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L446(lines 446 582) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L413(lines 413 582) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L380(lines 380 582) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L281(lines 281 582) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L579(lines 579 582) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L249(lines 249 582) no Hoare annotation was computed. [2020-12-09 16:00:11,834 INFO L262 CegarLoopResult]: For program point L514(lines 514 582) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L481(lines 481 582) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L316(lines 316 582) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L184-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L151-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L118-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L85-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L52-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L350(lines 350 582) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-09 16:00:11,835 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L258 CegarLoopResult]: At program point L583(lines 30 584) the Hoare annotation is: (let ((.cse0 (not (bvsge (_ bv218 32) (bvadd (bvsdiv (bvmul (bvsdiv ~a1~0 (_ bv5 32)) (_ bv5 32)) (_ bv5 32)) (_ bv505228 32))))) (.cse2 (= (_ bv9 32) ~a19~0)) (.cse1 (= (_ bv0 32) ~a10~0))) (or (= (_ bv2 32) ~a10~0) (and (= (_ bv6 32) ~a19~0) .cse0) (and .cse1 .cse0) (and (= (_ bv1 32) ~a10~0) .cse0) (= (_ bv8 32) ~a19~0) (and .cse2 .cse0) (and .cse2 .cse1))) [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L550(lines 550 582) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L418(lines 418 582) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L385(lines 385 582) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L220(lines 220 582) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L187-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L154-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L121-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L88-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L55-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L452(lines 452 582) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L287(lines 287 582) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L254(lines 254 582) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-09 16:00:11,836 INFO L262 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L519(lines 519 582) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L486(lines 486 582) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L265 CegarLoopResult]: At program point L586(lines 586 602) the Hoare annotation is: true [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L388(lines 388 582) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L355(lines 355 582) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L322(lines 322 582) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L190-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L157-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L124-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L91-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L58-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-09 16:00:11,837 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L555(lines 555 582) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L225(lines 225 582) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L424(lines 424 582) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L259(lines 259 582) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L193-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L160-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L127-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L94-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L61-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L524(lines 524 582) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L491(lines 491 582) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L458(lines 458 582) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L293(lines 293 582) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-09 16:00:11,838 INFO L262 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L558(lines 558 582) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L393(lines 393 582) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L327(lines 327 582) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L258 CegarLoopResult]: At program point L592-2(lines 592 601) the Hoare annotation is: (let ((.cse0 (not (bvsge (_ bv218 32) (bvadd (bvsdiv (bvmul (bvsdiv ~a1~0 (_ bv5 32)) (_ bv5 32)) (_ bv5 32)) (_ bv505228 32))))) (.cse2 (= (_ bv9 32) ~a19~0)) (.cse1 (= (_ bv0 32) ~a10~0))) (or (= (_ bv2 32) ~a10~0) (and (= (_ bv6 32) ~a19~0) .cse0) (and .cse1 .cse0) (and (= (_ bv1 32) ~a10~0) .cse0) (= (_ bv8 32) ~a19~0) (and .cse2 .cse0) (and .cse2 .cse1))) [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L361(lines 361 582) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L196-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L163-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L130-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L97-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L64-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L31-2(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L527(lines 527 582) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L296(lines 296 582) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L230(lines 230 582) no Hoare annotation was computed. [2020-12-09 16:00:11,839 INFO L262 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 176) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L429(lines 429 582) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L330(lines 330 582) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L264(lines 264 582) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L364(lines 364 582) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L199-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L166-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L133-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L100-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L67-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,840 INFO L262 CegarLoopResult]: For program point L34-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 16:00:11,841 INFO L262 CegarLoopResult]: For program point L497(lines 497 582) no Hoare annotation was computed. [2020-12-09 16:00:11,841 INFO L262 CegarLoopResult]: For program point L464(lines 464 582) no Hoare annotation was computed. [2020-12-09 16:00:11,841 INFO L262 CegarLoopResult]: For program point L398(lines 398 582) no Hoare annotation was computed. [2020-12-09 16:00:11,841 INFO L262 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-09 16:00:11,841 INFO L262 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-09 16:00:11,841 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-09 16:00:11,841 INFO L262 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-09 16:00:11,841 INFO L262 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-09 16:00:11,841 INFO L262 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-09 16:00:11,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:00:11 BoogieIcfgContainer [2020-12-09 16:00:11,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 16:00:11,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 16:00:11,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 16:00:11,855 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 16:00:11,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:58:14" (3/4) ... [2020-12-09 16:00:11,857 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 16:00:11,872 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 16:00:11,873 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 16:00:11,874 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 16:00:11,875 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 16:00:11,951 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aa09c127-2bec-4a57-b948-92d154ee26bf/bin/utaipan/witness.graphml [2020-12-09 16:00:11,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 16:00:11,952 INFO L168 Benchmark]: Toolchain (without parser) took 120225.82 ms. Allocated memory was 60.8 MB in the beginning and 142.6 MB in the end (delta: 81.8 MB). Free memory was 38.3 MB in the beginning and 71.2 MB in the end (delta: -32.9 MB). Peak memory consumption was 49.3 MB. Max. memory is 16.1 GB. [2020-12-09 16:00:11,952 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 60.8 MB. Free memory was 43.6 MB in the beginning and 43.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 16:00:11,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.08 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 38.1 MB in the beginning and 58.4 MB in the end (delta: -20.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 16.1 GB. [2020-12-09 16:00:11,952 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.04 ms. Allocated memory is still 79.7 MB. Free memory was 58.4 MB in the beginning and 53.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 16:00:11,953 INFO L168 Benchmark]: Boogie Preprocessor took 61.78 ms. Allocated memory is still 79.7 MB. Free memory was 53.2 MB in the beginning and 48.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 16:00:11,953 INFO L168 Benchmark]: RCFGBuilder took 2024.13 ms. Allocated memory is still 79.7 MB. Free memory was 48.4 MB in the beginning and 43.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 16.1 GB. [2020-12-09 16:00:11,953 INFO L168 Benchmark]: TraceAbstraction took 117515.51 ms. Allocated memory was 79.7 MB in the beginning and 142.6 MB in the end (delta: 62.9 MB). Free memory was 42.8 MB in the beginning and 85.9 MB in the end (delta: -43.1 MB). Peak memory consumption was 76.4 MB. Max. memory is 16.1 GB. [2020-12-09 16:00:11,953 INFO L168 Benchmark]: Witness Printer took 96.54 ms. Allocated memory is still 142.6 MB. Free memory was 85.9 MB in the beginning and 71.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 16:00:11,955 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.13 ms. Allocated memory is still 60.8 MB. Free memory was 43.6 MB in the beginning and 43.5 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 449.08 ms. Allocated memory was 60.8 MB in the beginning and 79.7 MB in the end (delta: 18.9 MB). Free memory was 38.1 MB in the beginning and 58.4 MB in the end (delta: -20.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.04 ms. Allocated memory is still 79.7 MB. Free memory was 58.4 MB in the beginning and 53.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.78 ms. Allocated memory is still 79.7 MB. Free memory was 53.2 MB in the beginning and 48.4 MB in the end (delta: 4.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2024.13 ms. Allocated memory is still 79.7 MB. Free memory was 48.4 MB in the beginning and 43.3 MB in the end (delta: 5.1 MB). Peak memory consumption was 19.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 117515.51 ms. Allocated memory was 79.7 MB in the beginning and 142.6 MB in the end (delta: 62.9 MB). Free memory was 42.8 MB in the beginning and 85.9 MB in the end (delta: -43.1 MB). Peak memory consumption was 76.4 MB. Max. memory is 16.1 GB. * Witness Printer took 96.54 ms. Allocated memory is still 142.6 MB. Free memory was 85.9 MB in the beginning and 71.2 MB in the end (delta: 14.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 176]: 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 || (6bv32 == a19 && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)))) || (0bv32 == a10 && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)))) || (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) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((2bv32 == a10 || (6bv32 == a19 && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)))) || (0bv32 == a10 && !~bvsge32(218bv32, ~bvadd64(~bvsdiv32(~bvmul32(~bvsdiv32(a1, 5bv32), 5bv32), 5bv32), 505228bv32)))) || (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) - 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.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 672 SDtfs, 1590 SDslu, 81 SDs, 0 SdLazy, 4541 SolverSat, 998 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 95.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3641 GetRequests, 3604 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.3s 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, 53 NumberOfFragments, 157 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1830 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 172 FormulaSimplificationTreeSizeReductionInter, 2.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2500 NumberOfCodeBlocks, 2500 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3637 ConstructedInterpolants, 0 QuantifiedInterpolants, 5705350 SizeOfPredicates, 23 NumberOfNonLiveVariables, 3104 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 2363/3142 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...