./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d87f1110511f627d03bb602e53b3240c96adaabd ................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d87f1110511f627d03bb602e53b3240c96adaabd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:28:59,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:28:59,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:28:59,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:28:59,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:28:59,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:28:59,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:28:59,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:28:59,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:28:59,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:28:59,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:28:59,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:28:59,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:28:59,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:28:59,727 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:28:59,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:28:59,729 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:28:59,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:28:59,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:28:59,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:28:59,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:28:59,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:28:59,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:28:59,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:28:59,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:28:59,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:28:59,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:28:59,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:28:59,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:28:59,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:28:59,739 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:28:59,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:28:59,740 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:28:59,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:28:59,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:28:59,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:28:59,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:28:59,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:28:59,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:28:59,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:28:59,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:28:59,745 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:28:59,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:28:59,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:28:59,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:28:59,759 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:28:59,759 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:28:59,759 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:28:59,759 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:28:59,760 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:28:59,760 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:28:59,760 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:28:59,760 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:28:59,760 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:28:59,761 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:28:59,761 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:28:59,761 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:28:59,762 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:28:59,762 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:28:59,762 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:28:59,762 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:28:59,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:28:59,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:28:59,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:28:59,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:28:59,763 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:28:59,763 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:28:59,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:28:59,764 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:28:59,764 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:28:59,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:28:59,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:28:59,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:28:59,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:28:59,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:28:59,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:28:59,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:28:59,765 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:28:59,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:28:59,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:28:59,766 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:28:59,766 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:28:59,766 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_513036b3-0601-496d-b17f-911a7fccb1bd/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(__VERIFIER_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 -> d87f1110511f627d03bb602e53b3240c96adaabd [2019-12-07 11:28:59,872 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:28:59,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:28:59,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:28:59,882 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:28:59,883 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:28:59,883 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-12-07 11:28:59,920 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data/a8be7e91e/1df2fddc1e3b4993ab770733f040c5d6/FLAG861183d09 [2019-12-07 11:29:00,378 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:29:00,378 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-12-07 11:29:00,389 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data/a8be7e91e/1df2fddc1e3b4993ab770733f040c5d6/FLAG861183d09 [2019-12-07 11:29:00,398 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data/a8be7e91e/1df2fddc1e3b4993ab770733f040c5d6 [2019-12-07 11:29:00,400 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:29:00,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:29:00,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:00,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:29:00,404 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:29:00,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bc09e67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00, skipping insertion in model container [2019-12-07 11:29:00,406 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:29:00,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:29:00,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:00,767 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:29:00,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:00,859 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:29:00,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00 WrapperNode [2019-12-07 11:29:00,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:00,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:00,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:29:00,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:29:00,865 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:00,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:29:00,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:29:00,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:29:00,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... [2019-12-07 11:29:00,942 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:29:00,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:29:00,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:29:00,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:29:00,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:29:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:29:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2019-12-07 11:29:00,983 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2019-12-07 11:29:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:29:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:29:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2019-12-07 11:29:00,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2019-12-07 11:29:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:29:00,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:29:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2019-12-07 11:29:00,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2019-12-07 11:29:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2019-12-07 11:29:00,984 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2019-12-07 11:29:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:29:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2019-12-07 11:29:00,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2019-12-07 11:29:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:29:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2019-12-07 11:29:00,984 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2019-12-07 11:29:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 11:29:00,984 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2019-12-07 11:29:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2019-12-07 11:29:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-12-07 11:29:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:29:00,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:29:16,256 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:29:16,256 INFO L287 CfgBuilder]: Removed 38 assume(true) statements. [2019-12-07 11:29:16,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:16 BoogieIcfgContainer [2019-12-07 11:29:16,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:29:16,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:29:16,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:29:16,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:29:16,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:29:00" (1/3) ... [2019-12-07 11:29:16,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f50d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:16, skipping insertion in model container [2019-12-07 11:29:16,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:00" (2/3) ... [2019-12-07 11:29:16,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f50d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:16, skipping insertion in model container [2019-12-07 11:29:16,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:16" (3/3) ... [2019-12-07 11:29:16,262 INFO L109 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2019-12-07 11:29:16,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:29:16,273 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:29:16,281 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:29:16,296 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:29:16,297 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:29:16,297 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:29:16,297 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:29:16,297 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:29:16,297 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:29:16,297 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:29:16,298 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:29:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-12-07 11:29:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 11:29:16,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:16,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:16,315 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:16,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:16,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1641350473, now seen corresponding path program 1 times [2019-12-07 11:29:16,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:16,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522698880] [2019-12-07 11:29:16,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:29:16,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522698880] [2019-12-07 11:29:16,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:16,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:29:16,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078495235] [2019-12-07 11:29:16,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:29:16,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:29:16,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:29:16,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:29:16,648 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 8 states. [2019-12-07 11:29:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:29:25,144 INFO L93 Difference]: Finished difference Result 176 states and 258 transitions. [2019-12-07 11:29:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:29:25,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2019-12-07 11:29:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:29:25,153 INFO L225 Difference]: With dead ends: 176 [2019-12-07 11:29:25,153 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 11:29:25,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:29:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 11:29:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-12-07 11:29:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 11:29:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 109 transitions. [2019-12-07 11:29:25,189 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 109 transitions. Word has length 12 [2019-12-07 11:29:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:29:25,190 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 109 transitions. [2019-12-07 11:29:25,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:29:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 109 transitions. [2019-12-07 11:29:25,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:29:25,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:25,192 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:25,192 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:25,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1984653740, now seen corresponding path program 1 times [2019-12-07 11:29:25,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:29:25,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704850503] [2019-12-07 11:29:25,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:29:25,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:25,358 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1315) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1196) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) 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.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:573) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:269) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:205) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 11:29:25,361 INFO L168 Benchmark]: Toolchain (without parser) took 24959.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 933.5 MB in the beginning and 1.0 GB in the end (delta: -89.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:25,361 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:29:25,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:25,362 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:25,363 INFO L168 Benchmark]: Boogie Preprocessor took 37.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:25,363 INFO L168 Benchmark]: RCFGBuilder took 15315.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 869.5 MB in the end (delta: 196.8 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:29:25,364 INFO L168 Benchmark]: TraceAbstraction took 9101.47 ms. Allocated memory is still 1.1 GB. Free memory was 869.5 MB in the beginning and 1.0 GB in the end (delta: -153.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:29:25,366 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 458.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 933.5 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 15315.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 869.5 MB in the end (delta: 196.8 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9101.47 ms. Allocated memory is still 1.1 GB. Free memory was 869.5 MB in the beginning and 1.0 GB in the end (delta: -153.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 11:29:26,758 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:29:26,760 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:29:26,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:29:26,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:29:26,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:29:26,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:29:26,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:29:26,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:29:26,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:29:26,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:29:26,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:29:26,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:29:26,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:29:26,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:29:26,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:29:26,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:29:26,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:29:26,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:29:26,781 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:29:26,782 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:29:26,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:29:26,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:29:26,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:29:26,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:29:26,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:29:26,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:29:26,787 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:29:26,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:29:26,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:29:26,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:29:26,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:29:26,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:29:26,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:29:26,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:29:26,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:29:26,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:29:26,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:29:26,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:29:26,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:29:26,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:29:26,793 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-12-07 11:29:26,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:29:26,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:29:26,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:29:26,804 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:29:26,804 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:29:26,805 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:29:26,805 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:29:26,805 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:29:26,805 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:29:26,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:29:26,806 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:29:26,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:29:26,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:29:26,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:29:26,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:29:26,806 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:29:26,806 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:29:26,806 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:29:26,807 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:29:26,807 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:29:26,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:29:26,807 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:29:26,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:29:26,807 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:29:26,807 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:29:26,807 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:29:26,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:29:26,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:29:26,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:29:26,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:29:26,808 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:29:26,808 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 11:29:26,808 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:29:26,808 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:29:26,809 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:29:26,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:29:26,809 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_513036b3-0601-496d-b17f-911a7fccb1bd/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(__VERIFIER_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 -> d87f1110511f627d03bb602e53b3240c96adaabd [2019-12-07 11:29:26,976 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:29:26,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:29:26,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:29:26,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:29:26,990 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:29:26,991 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-12-07 11:29:27,033 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data/a8b562566/9f856effa2eb4652a59228951650f624/FLAG34c65f162 [2019-12-07 11:29:27,490 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:29:27,491 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-12-07 11:29:27,504 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data/a8b562566/9f856effa2eb4652a59228951650f624/FLAG34c65f162 [2019-12-07 11:29:27,808 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/data/a8b562566/9f856effa2eb4652a59228951650f624 [2019-12-07 11:29:27,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:29:27,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:29:27,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:27,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:29:27,820 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:29:27,822 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:27" (1/1) ... [2019-12-07 11:29:27,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21518952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:27, skipping insertion in model container [2019-12-07 11:29:27,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:29:27" (1/1) ... [2019-12-07 11:29:27,833 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:29:27,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:29:28,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:28,165 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:29:28,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:29:28,284 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:29:28,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28 WrapperNode [2019-12-07 11:29:28,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:29:28,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:28,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:29:28,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:29:28,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... [2019-12-07 11:29:28,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... [2019-12-07 11:29:28,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:29:28,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:29:28,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:29:28,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:29:28,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... [2019-12-07 11:29:28,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... [2019-12-07 11:29:28,343 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... [2019-12-07 11:29:28,343 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... [2019-12-07 11:29:28,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... [2019-12-07 11:29:28,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... [2019-12-07 11:29:28,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... [2019-12-07 11:29:28,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:29:28,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:29:28,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:29:28,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:29:28,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:29:28,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 11:29:28,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 11:29:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2019-12-07 11:29:28,422 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2019-12-07 11:29:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 11:29:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2019-12-07 11:29:28,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2019-12-07 11:29:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 11:29:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:29:28,422 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2019-12-07 11:29:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2019-12-07 11:29:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2019-12-07 11:29:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2019-12-07 11:29:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 11:29:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2019-12-07 11:29:28,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2019-12-07 11:29:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:29:28,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 11:29:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-12-07 11:29:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2019-12-07 11:29:28,424 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2019-12-07 11:29:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2019-12-07 11:29:28,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2019-12-07 11:29:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-12-07 11:29:28,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:29:28,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:29:36,743 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:29:36,743 INFO L287 CfgBuilder]: Removed 38 assume(true) statements. [2019-12-07 11:29:36,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:36 BoogieIcfgContainer [2019-12-07 11:29:36,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:29:36,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:29:36,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:29:36,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:29:36,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:29:27" (1/3) ... [2019-12-07 11:29:36,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3caf3219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:36, skipping insertion in model container [2019-12-07 11:29:36,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:29:28" (2/3) ... [2019-12-07 11:29:36,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3caf3219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:29:36, skipping insertion in model container [2019-12-07 11:29:36,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:36" (3/3) ... [2019-12-07 11:29:36,752 INFO L109 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2019-12-07 11:29:36,758 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:29:36,763 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:29:36,770 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 11:29:36,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:29:36,786 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:29:36,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:29:36,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:29:36,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:29:36,786 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:29:36,786 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:29:36,786 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:29:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-12-07 11:29:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:29:36,804 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:29:36,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:29:36,805 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:29:36,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:29:36,809 INFO L82 PathProgramCache]: Analyzing trace with hash 191678913, now seen corresponding path program 1 times [2019-12-07 11:29:36,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:29:36,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [775254844] [2019-12-07 11:29:36,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:29:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:29:36,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:29:36,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:29:36,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:29:36,981 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:36,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:29:36,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:36,988 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:29:37,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:29:37,039 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,043 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:29:37,044 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,059 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 11:29:37,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:29:37,060 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 11:29:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:29:37,091 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:29:37,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:37,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:37,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:37,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:29:37,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:29:37,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [775254844] [2019-12-07 11:29:37,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:29:37,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 11:29:37,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122873026] [2019-12-07 11:29:37,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:29:37,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:29:37,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:29:37,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:29:37,232 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 13 states. [2019-12-07 11:30:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:12,180 INFO L93 Difference]: Finished difference Result 269 states and 399 transitions. [2019-12-07 11:30:12,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:30:12,182 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-07 11:30:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:12,191 INFO L225 Difference]: With dead ends: 269 [2019-12-07 11:30:12,191 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 11:30:12,195 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:30:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 11:30:12,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-12-07 11:30:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 11:30:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2019-12-07 11:30:12,229 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 15 [2019-12-07 11:30:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:12,229 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2019-12-07 11:30:12,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:30:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2019-12-07 11:30:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:30:12,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:12,231 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:12,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:30:12,432 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:12,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:12,433 INFO L82 PathProgramCache]: Analyzing trace with hash -835354618, now seen corresponding path program 1 times [2019-12-07 11:30:12,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:30:12,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293679076] [2019-12-07 11:30:12,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:30:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:12,541 INFO L264 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:30:12,543 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:12,550 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:30:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:12,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293679076] [2019-12-07 11:30:12,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:12,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:30:12,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572085502] [2019-12-07 11:30:12,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:30:12,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:30:12,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:30:12,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:12,562 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 4 states. [2019-12-07 11:30:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:30:12,584 INFO L93 Difference]: Finished difference Result 236 states and 346 transitions. [2019-12-07 11:30:12,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:30:12,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 11:30:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:30:12,587 INFO L225 Difference]: With dead ends: 236 [2019-12-07 11:30:12,587 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 11:30:12,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:30:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 11:30:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-12-07 11:30:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 11:30:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2019-12-07 11:30:12,600 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 27 [2019-12-07 11:30:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:30:12,600 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2019-12-07 11:30:12,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:30:12,600 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2019-12-07 11:30:12,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:30:12,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:30:12,602 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:30:12,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 11:30:12,803 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:30:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:30:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash 313595982, now seen corresponding path program 1 times [2019-12-07 11:30:12,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:30:12,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433076302] [2019-12-07 11:30:12,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:30:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:30:12,946 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:30:12,949 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:30:12,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:30:12,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:12,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:30:12,974 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:12,974 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:30:13,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:30:13,005 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:13,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:30:13,007 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:30:13,017 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 11:30:13,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:30:13,017 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 11:30:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:13,040 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:30:13,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:13,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:13,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:13,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:30:13,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:30:13,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433076302] [2019-12-07 11:30:13,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:30:13,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 11:30:13,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401832184] [2019-12-07 11:30:13,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:30:13,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:30:13,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:30:13,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:30:13,135 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand 13 states. [2019-12-07 11:31:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:00,522 INFO L93 Difference]: Finished difference Result 270 states and 402 transitions. [2019-12-07 11:31:00,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:31:00,523 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-12-07 11:31:00,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:00,525 INFO L225 Difference]: With dead ends: 270 [2019-12-07 11:31:00,525 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 11:31:00,526 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:31:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 11:31:00,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-12-07 11:31:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 11:31:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 203 transitions. [2019-12-07 11:31:00,538 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 203 transitions. Word has length 28 [2019-12-07 11:31:00,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:00,538 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 203 transitions. [2019-12-07 11:31:00,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:31:00,538 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 203 transitions. [2019-12-07 11:31:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:31:00,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:00,539 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:31:00,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 11:31:00,740 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:00,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:00,740 INFO L82 PathProgramCache]: Analyzing trace with hash 571761420, now seen corresponding path program 1 times [2019-12-07 11:31:00,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:31:00,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195816510] [2019-12-07 11:31:00,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:31:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:00,888 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:31:00,890 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:00,904 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:31:00,904 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:00,909 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:00,909 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:00,909 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 11:31:00,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:00,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 11:31:00,947 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:00,964 INFO L614 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2019-12-07 11:31:00,964 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:31:00,965 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-12-07 11:31:00,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:31:00,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:00,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:00,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:00,979 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 11:31:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:00,996 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:00,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:00,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:01,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195816510] [2019-12-07 11:31:01,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:31:01,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2019-12-07 11:31:01,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773418832] [2019-12-07 11:31:01,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:31:01,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:31:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:31:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:31:01,043 INFO L87 Difference]: Start difference. First operand 146 states and 203 transitions. Second operand 6 states. [2019-12-07 11:31:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:06,112 INFO L93 Difference]: Finished difference Result 389 states and 592 transitions. [2019-12-07 11:31:06,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:31:06,113 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 11:31:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:06,116 INFO L225 Difference]: With dead ends: 389 [2019-12-07 11:31:06,116 INFO L226 Difference]: Without dead ends: 257 [2019-12-07 11:31:06,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:31:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-12-07 11:31:06,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 246. [2019-12-07 11:31:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 11:31:06,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 363 transitions. [2019-12-07 11:31:06,135 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 363 transitions. Word has length 28 [2019-12-07 11:31:06,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:06,136 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 363 transitions. [2019-12-07 11:31:06,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:31:06,136 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 363 transitions. [2019-12-07 11:31:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:31:06,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:06,137 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:31:06,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 11:31:06,338 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:06,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:06,339 INFO L82 PathProgramCache]: Analyzing trace with hash -2025119411, now seen corresponding path program 1 times [2019-12-07 11:31:06,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:31:06,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033377662] [2019-12-07 11:31:06,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:31:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:06,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:31:06,476 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:06,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:31:06,479 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:06,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:06,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:06,481 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:31:06,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:06,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:31:06,507 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:06,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:31:06,511 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:06,516 INFO L614 ElimStorePlain]: treesize reduction 11, result has 15.4 percent of original size [2019-12-07 11:31:06,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:06,517 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:2 [2019-12-07 11:31:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:06,524 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:06,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:06,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033377662] [2019-12-07 11:31:06,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:06,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-12-07 11:31:06,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675404716] [2019-12-07 11:31:06,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:31:06,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:31:06,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:31:06,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:31:06,577 INFO L87 Difference]: Start difference. First operand 246 states and 363 transitions. Second operand 11 states. [2019-12-07 11:31:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:27,913 INFO L93 Difference]: Finished difference Result 489 states and 723 transitions. [2019-12-07 11:31:27,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:31:27,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-12-07 11:31:27,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:27,917 INFO L225 Difference]: With dead ends: 489 [2019-12-07 11:31:27,917 INFO L226 Difference]: Without dead ends: 252 [2019-12-07 11:31:27,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:31:27,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-12-07 11:31:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2019-12-07 11:31:27,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-12-07 11:31:27,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 366 transitions. [2019-12-07 11:31:27,936 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 366 transitions. Word has length 29 [2019-12-07 11:31:27,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:27,936 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 366 transitions. [2019-12-07 11:31:27,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:31:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 366 transitions. [2019-12-07 11:31:27,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:31:27,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:27,938 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:31:28,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 11:31:28,139 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:28,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1907924199, now seen corresponding path program 1 times [2019-12-07 11:31:28,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:31:28,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903405154] [2019-12-07 11:31:28,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:31:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:28,275 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:31:28,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:28,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:31:28,281 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:28,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:28,283 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:28,284 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:31:28,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:31:28,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:28,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:31:28,315 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:28,328 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 11:31:28,328 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:28,328 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 11:31:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:28,352 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:28,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:28,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:28,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:28,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:28,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903405154] [2019-12-07 11:31:28,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:28,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 11:31:28,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091863312] [2019-12-07 11:31:28,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:31:28,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:31:28,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:31:28,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:31:28,447 INFO L87 Difference]: Start difference. First operand 249 states and 366 transitions. Second operand 13 states. [2019-12-07 11:31:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:47,682 INFO L93 Difference]: Finished difference Result 483 states and 715 transitions. [2019-12-07 11:31:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:31:47,683 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-07 11:31:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:47,685 INFO L225 Difference]: With dead ends: 483 [2019-12-07 11:31:47,685 INFO L226 Difference]: Without dead ends: 247 [2019-12-07 11:31:47,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:31:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-07 11:31:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-12-07 11:31:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 11:31:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 361 transitions. [2019-12-07 11:31:47,698 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 361 transitions. Word has length 30 [2019-12-07 11:31:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:47,698 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 361 transitions. [2019-12-07 11:31:47,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:31:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 361 transitions. [2019-12-07 11:31:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:31:47,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:47,699 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:31:47,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 11:31:47,901 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash -887190847, now seen corresponding path program 1 times [2019-12-07 11:31:47,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:31:47,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974091390] [2019-12-07 11:31:47,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:31:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:48,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:31:48,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:48,020 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:31:48,020 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:48,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:48,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:48,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:31:48,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:48,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 11:31:48,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:48,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:48,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:48,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2019-12-07 11:31:48,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:48,058 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:48,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:48,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974091390] [2019-12-07 11:31:48,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:31:48,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 11:31:48,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644217951] [2019-12-07 11:31:48,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:31:48,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:31:48,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:31:48,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:31:48,063 INFO L87 Difference]: Start difference. First operand 245 states and 361 transitions. Second operand 7 states. [2019-12-07 11:31:55,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:31:55,079 INFO L93 Difference]: Finished difference Result 487 states and 782 transitions. [2019-12-07 11:31:55,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:31:55,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-07 11:31:55,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:31:55,082 INFO L225 Difference]: With dead ends: 487 [2019-12-07 11:31:55,082 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 11:31:55,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:31:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 11:31:55,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-12-07 11:31:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-07 11:31:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 369 transitions. [2019-12-07 11:31:55,097 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 369 transitions. Word has length 30 [2019-12-07 11:31:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:31:55,098 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 369 transitions. [2019-12-07 11:31:55,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:31:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 369 transitions. [2019-12-07 11:31:55,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:31:55,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:31:55,099 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 11:31:55,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 11:31:55,300 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:31:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:31:55,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1592982185, now seen corresponding path program 1 times [2019-12-07 11:31:55,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:31:55,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780811826] [2019-12-07 11:31:55,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 11:31:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:31:55,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:31:55,447 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:31:55,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:31:55,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:55,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:55,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:55,462 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 11:31:55,492 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:55,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 11:31:55,493 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:55,508 INFO L614 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2019-12-07 11:31:55,508 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:31:55,508 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-12-07 11:31:55,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:31:55,518 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:31:55,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:31:55,519 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:31:55,519 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 11:31:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:55,535 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:31:55,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:55,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:31:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:31:55,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780811826] [2019-12-07 11:31:55,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 11:31:55,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2019-12-07 11:31:55,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543171417] [2019-12-07 11:31:55,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:31:55,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:31:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:31:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:31:55,578 INFO L87 Difference]: Start difference. First operand 253 states and 369 transitions. Second operand 6 states. [2019-12-07 11:32:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:02,832 INFO L93 Difference]: Finished difference Result 701 states and 1145 transitions. [2019-12-07 11:32:02,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:32:02,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 11:32:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:02,835 INFO L225 Difference]: With dead ends: 701 [2019-12-07 11:32:02,835 INFO L226 Difference]: Without dead ends: 423 [2019-12-07 11:32:02,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:32:02,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-07 11:32:02,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 284. [2019-12-07 11:32:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-12-07 11:32:02,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 407 transitions. [2019-12-07 11:32:02,858 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 407 transitions. Word has length 31 [2019-12-07 11:32:02,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:02,858 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 407 transitions. [2019-12-07 11:32:02,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:02,858 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 407 transitions. [2019-12-07 11:32:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:32:02,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:02,860 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:32:03,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 11:32:03,061 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash -955605667, now seen corresponding path program 1 times [2019-12-07 11:32:03,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:32:03,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416945468] [2019-12-07 11:32:03,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:32:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:03,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:32:03,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:03,199 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:32:03,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:03,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:03,201 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:03,201 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:32:03,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:32:03,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:03,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:03,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:03,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 11:32:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:32:03,235 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:32:03,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416945468] [2019-12-07 11:32:03,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:03,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 11:32:03,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957073000] [2019-12-07 11:32:03,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:32:03,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:32:03,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:32:03,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:32:03,303 INFO L87 Difference]: Start difference. First operand 284 states and 407 transitions. Second operand 12 states. [2019-12-07 11:32:21,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:21,860 INFO L93 Difference]: Finished difference Result 634 states and 985 transitions. [2019-12-07 11:32:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:32:21,860 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-12-07 11:32:21,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:21,862 INFO L225 Difference]: With dead ends: 634 [2019-12-07 11:32:21,862 INFO L226 Difference]: Without dead ends: 361 [2019-12-07 11:32:21,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:32:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-07 11:32:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 327. [2019-12-07 11:32:21,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-07 11:32:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 460 transitions. [2019-12-07 11:32:21,875 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 460 transitions. Word has length 41 [2019-12-07 11:32:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:21,875 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 460 transitions. [2019-12-07 11:32:21,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:32:21,875 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 460 transitions. [2019-12-07 11:32:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:32:21,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:21,877 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:32:22,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 11:32:22,077 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:22,078 INFO L82 PathProgramCache]: Analyzing trace with hash -794400909, now seen corresponding path program 1 times [2019-12-07 11:32:22,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:32:22,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834170617] [2019-12-07 11:32:22,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/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 [2019-12-07 11:32:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:22,222 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:32:22,223 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:32:22,230 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:32:22,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834170617] [2019-12-07 11:32:22,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:22,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:32:22,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687947948] [2019-12-07 11:32:22,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:32:22,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:32:22,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:32:22,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:32:22,240 INFO L87 Difference]: Start difference. First operand 327 states and 460 transitions. Second operand 4 states. [2019-12-07 11:32:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:22,262 INFO L93 Difference]: Finished difference Result 610 states and 921 transitions. [2019-12-07 11:32:22,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:32:22,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 11:32:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:22,265 INFO L225 Difference]: With dead ends: 610 [2019-12-07 11:32:22,265 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 11:32:22,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:32:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 11:32:22,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-12-07 11:32:22,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-07 11:32:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 465 transitions. [2019-12-07 11:32:22,282 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 465 transitions. Word has length 41 [2019-12-07 11:32:22,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:22,283 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 465 transitions. [2019-12-07 11:32:22,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:32:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 465 transitions. [2019-12-07 11:32:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:32:22,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:22,284 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:32:22,485 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 11:32:22,485 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:22,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:22,486 INFO L82 PathProgramCache]: Analyzing trace with hash -540510950, now seen corresponding path program 1 times [2019-12-07 11:32:22,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:32:22,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932191795] [2019-12-07 11:32:22,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 11:32:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:22,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:32:22,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:22,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:32:22,646 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:22,647 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:22,648 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:22,648 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:32:22,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:22,670 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:32:22,671 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:22,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:32:22,672 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:22,678 INFO L614 ElimStorePlain]: treesize reduction 11, result has 15.4 percent of original size [2019-12-07 11:32:22,678 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:22,678 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:2 [2019-12-07 11:32:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:32:22,685 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:22,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:32:22,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932191795] [2019-12-07 11:32:22,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:22,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-12-07 11:32:22,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599040709] [2019-12-07 11:32:22,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:32:22,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:32:22,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:32:22,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:32:22,733 INFO L87 Difference]: Start difference. First operand 333 states and 465 transitions. Second operand 11 states. [2019-12-07 11:32:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:45,670 INFO L93 Difference]: Finished difference Result 639 states and 961 transitions. [2019-12-07 11:32:45,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:32:45,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-12-07 11:32:45,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:45,673 INFO L225 Difference]: With dead ends: 639 [2019-12-07 11:32:45,674 INFO L226 Difference]: Without dead ends: 356 [2019-12-07 11:32:45,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:32:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-07 11:32:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 342. [2019-12-07 11:32:45,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-07 11:32:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 478 transitions. [2019-12-07 11:32:45,690 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 478 transitions. Word has length 42 [2019-12-07 11:32:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:45,690 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 478 transitions. [2019-12-07 11:32:45,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:32:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 478 transitions. [2019-12-07 11:32:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:32:45,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:45,692 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:32:45,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 11:32:45,893 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:45,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash -478471336, now seen corresponding path program 1 times [2019-12-07 11:32:45,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:32:45,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927307259] [2019-12-07 11:32:45,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 11:32:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:46,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:32:46,033 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:32:46,037 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:32:46,037 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:46,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:32:46,039 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:46,039 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:32:46,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:32:46,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:46,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:32:46,065 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:32:46,074 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 11:32:46,074 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:32:46,075 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 11:32:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:32:46,095 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:32:46,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:46,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:46,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:32:46,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:32:46,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927307259] [2019-12-07 11:32:46,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:46,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 11:32:46,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159231338] [2019-12-07 11:32:46,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:32:46,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:32:46,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:32:46,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:32:46,167 INFO L87 Difference]: Start difference. First operand 342 states and 478 transitions. Second operand 13 states. [2019-12-07 11:33:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:03,834 INFO L93 Difference]: Finished difference Result 673 states and 1028 transitions. [2019-12-07 11:33:03,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:33:03,835 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2019-12-07 11:33:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:03,837 INFO L225 Difference]: With dead ends: 673 [2019-12-07 11:33:03,837 INFO L226 Difference]: Without dead ends: 381 [2019-12-07 11:33:03,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:33:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-12-07 11:33:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2019-12-07 11:33:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-07 11:33:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 508 transitions. [2019-12-07 11:33:03,849 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 508 transitions. Word has length 42 [2019-12-07 11:33:03,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:03,849 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 508 transitions. [2019-12-07 11:33:03,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:33:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 508 transitions. [2019-12-07 11:33:03,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:33:03,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:03,851 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:33:04,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 11:33:04,051 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:04,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939229, now seen corresponding path program 1 times [2019-12-07 11:33:04,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:33:04,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248293117] [2019-12-07 11:33:04,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:04,151 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:33:04,152 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:04,188 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:33:04,188 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:04,192 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:04,192 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:04,192 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-12-07 11:33:04,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:33:04,204 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:04,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:04,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:04,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 11:33:04,270 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:04,271 INFO L614 ElimStorePlain]: treesize reduction 3, result has 25.0 percent of original size [2019-12-07 11:33:04,271 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:04,271 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2019-12-07 11:33:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 11:33:04,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248293117] [2019-12-07 11:33:04,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:04,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 11:33:04,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356800101] [2019-12-07 11:33:04,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:33:04,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:33:04,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:33:04,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:33:04,275 INFO L87 Difference]: Start difference. First operand 363 states and 508 transitions. Second operand 12 states. [2019-12-07 11:33:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:17,626 INFO L93 Difference]: Finished difference Result 1171 states and 2006 transitions. [2019-12-07 11:33:17,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:33:17,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-12-07 11:33:17,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:17,632 INFO L225 Difference]: With dead ends: 1171 [2019-12-07 11:33:17,632 INFO L226 Difference]: Without dead ends: 820 [2019-12-07 11:33:17,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:33:17,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-07 11:33:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 792. [2019-12-07 11:33:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-07 11:33:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1340 transitions. [2019-12-07 11:33:17,663 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1340 transitions. Word has length 42 [2019-12-07 11:33:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:17,663 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1340 transitions. [2019-12-07 11:33:17,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:33:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1340 transitions. [2019-12-07 11:33:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:33:17,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:17,665 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:33:17,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 11:33:17,866 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:17,866 INFO L82 PathProgramCache]: Analyzing trace with hash -948133215, now seen corresponding path program 1 times [2019-12-07 11:33:17,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:33:17,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900082494] [2019-12-07 11:33:17,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:17,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:33:17,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:17,979 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:33:17,979 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:17,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:17,981 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:17,981 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:33:17,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:33:17,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:17,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:17,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:17,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 11:33:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:33:18,020 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:18,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:18,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:18,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:18,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:18,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:33:18,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:33:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:33:18,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900082494] [2019-12-07 11:33:18,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:18,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 12 [2019-12-07 11:33:18,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395838066] [2019-12-07 11:33:18,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:33:18,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:33:18,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:33:18,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:33:18,092 INFO L87 Difference]: Start difference. First operand 792 states and 1340 transitions. Second operand 12 states. [2019-12-07 11:33:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:25,481 INFO L93 Difference]: Finished difference Result 1669 states and 3314 transitions. [2019-12-07 11:33:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:33:25,482 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-12-07 11:33:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:25,489 INFO L225 Difference]: With dead ends: 1669 [2019-12-07 11:33:25,490 INFO L226 Difference]: Without dead ends: 937 [2019-12-07 11:33:25,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:33:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-12-07 11:33:25,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 900. [2019-12-07 11:33:25,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-07 11:33:25,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1536 transitions. [2019-12-07 11:33:25,536 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1536 transitions. Word has length 42 [2019-12-07 11:33:25,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:25,537 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1536 transitions. [2019-12-07 11:33:25,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:33:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1536 transitions. [2019-12-07 11:33:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:33:25,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:25,538 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:33:25,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 11:33:25,739 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:25,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1828765838, now seen corresponding path program 1 times [2019-12-07 11:33:25,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:33:25,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595694646] [2019-12-07 11:33:25,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:25,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:33:25,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:25,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:33:25,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:25,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:25,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:25,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:33:25,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:33:25,887 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:25,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:25,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:25,888 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 11:33:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:25,907 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:25,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:25,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595694646] [2019-12-07 11:33:25,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:25,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-07 11:33:25,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289945540] [2019-12-07 11:33:25,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:33:25,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:33:25,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:33:25,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:33:25,913 INFO L87 Difference]: Start difference. First operand 900 states and 1536 transitions. Second operand 8 states. [2019-12-07 11:33:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:37,572 INFO L93 Difference]: Finished difference Result 1819 states and 3652 transitions. [2019-12-07 11:33:37,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:33:37,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-12-07 11:33:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:37,579 INFO L225 Difference]: With dead ends: 1819 [2019-12-07 11:33:37,579 INFO L226 Difference]: Without dead ends: 979 [2019-12-07 11:33:37,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:33:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-12-07 11:33:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 965. [2019-12-07 11:33:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-12-07 11:33:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1638 transitions. [2019-12-07 11:33:37,617 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1638 transitions. Word has length 42 [2019-12-07 11:33:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:37,618 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1638 transitions. [2019-12-07 11:33:37,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:33:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1638 transitions. [2019-12-07 11:33:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:33:37,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:37,620 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:33:37,820 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 11:33:37,821 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:37,821 INFO L82 PathProgramCache]: Analyzing trace with hash -757221373, now seen corresponding path program 1 times [2019-12-07 11:33:37,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:33:37,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134429035] [2019-12-07 11:33:37,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:37,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:33:37,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:37,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:33:37,923 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:37,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:37,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:37,924 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:33:37,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:37,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:33:37,947 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:37,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:33:37,949 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:37,953 INFO L614 ElimStorePlain]: treesize reduction 11, result has 15.4 percent of original size [2019-12-07 11:33:37,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:37,954 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:2 [2019-12-07 11:33:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:37,961 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:37,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:38,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134429035] [2019-12-07 11:33:38,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:38,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-12-07 11:33:38,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293040544] [2019-12-07 11:33:38,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:33:38,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:33:38,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:33:38,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:33:38,015 INFO L87 Difference]: Start difference. First operand 965 states and 1638 transitions. Second operand 11 states. [2019-12-07 11:33:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:56,776 INFO L93 Difference]: Finished difference Result 1988 states and 4011 transitions. [2019-12-07 11:33:56,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:33:56,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-12-07 11:33:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:56,785 INFO L225 Difference]: With dead ends: 1988 [2019-12-07 11:33:56,786 INFO L226 Difference]: Without dead ends: 1046 [2019-12-07 11:33:56,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:33:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-12-07 11:33:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 996. [2019-12-07 11:33:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-12-07 11:33:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1675 transitions. [2019-12-07 11:33:56,836 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1675 transitions. Word has length 43 [2019-12-07 11:33:56,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:56,836 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1675 transitions. [2019-12-07 11:33:56,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:33:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1675 transitions. [2019-12-07 11:33:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 11:33:56,838 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:56,838 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:33:57,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 11:33:57,039 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:57,039 INFO L82 PathProgramCache]: Analyzing trace with hash 204385454, now seen corresponding path program 1 times [2019-12-07 11:33:57,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:33:57,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011207903] [2019-12-07 11:33:57,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 11:33:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:57,155 INFO L264 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:33:57,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:33:57,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:33:57,191 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:57,195 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:33:57,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:57,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-12-07 11:33:57,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:33:57,208 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:33:57,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:33:57,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 11:33:57,269 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:33:57,270 INFO L614 ElimStorePlain]: treesize reduction 3, result has 25.0 percent of original size [2019-12-07 11:33:57,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:33:57,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2019-12-07 11:33:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 11:33:57,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011207903] [2019-12-07 11:33:57,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:57,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 11:33:57,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47511460] [2019-12-07 11:33:57,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:33:57,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:33:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:33:57,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:33:57,273 INFO L87 Difference]: Start difference. First operand 996 states and 1675 transitions. Second operand 12 states. [2019-12-07 11:34:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:11,043 INFO L93 Difference]: Finished difference Result 2659 states and 6033 transitions. [2019-12-07 11:34:11,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:34:11,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2019-12-07 11:34:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:11,056 INFO L225 Difference]: With dead ends: 2659 [2019-12-07 11:34:11,056 INFO L226 Difference]: Without dead ends: 1676 [2019-12-07 11:34:11,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:34:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-12-07 11:34:11,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1649. [2019-12-07 11:34:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-12-07 11:34:11,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 3570 transitions. [2019-12-07 11:34:11,131 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 3570 transitions. Word has length 46 [2019-12-07 11:34:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:11,131 INFO L462 AbstractCegarLoop]: Abstraction has 1649 states and 3570 transitions. [2019-12-07 11:34:11,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:34:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 3570 transitions. [2019-12-07 11:34:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 11:34:11,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:11,133 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:34:11,333 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 11:34:11,334 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:11,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:11,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1846598544, now seen corresponding path program 1 times [2019-12-07 11:34:11,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:11,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623168422] [2019-12-07 11:34:11,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:11,471 INFO L264 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:34:11,472 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:11,493 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:11,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:11,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623168422] [2019-12-07 11:34:11,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:11,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 11:34:11,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684878989] [2019-12-07 11:34:11,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:34:11,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:11,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:34:11,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:34:11,505 INFO L87 Difference]: Start difference. First operand 1649 states and 3570 transitions. Second operand 5 states. [2019-12-07 11:34:11,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:11,562 INFO L93 Difference]: Finished difference Result 3338 states and 9649 transitions. [2019-12-07 11:34:11,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:34:11,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-07 11:34:11,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:11,579 INFO L225 Difference]: With dead ends: 3338 [2019-12-07 11:34:11,579 INFO L226 Difference]: Without dead ends: 1700 [2019-12-07 11:34:11,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:34:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-07 11:34:11,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1653. [2019-12-07 11:34:11,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1653 states. [2019-12-07 11:34:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 3576 transitions. [2019-12-07 11:34:11,666 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 3576 transitions. Word has length 46 [2019-12-07 11:34:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:11,666 INFO L462 AbstractCegarLoop]: Abstraction has 1653 states and 3576 transitions. [2019-12-07 11:34:11,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:34:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 3576 transitions. [2019-12-07 11:34:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 11:34:11,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:11,668 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:34:11,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 11:34:11,869 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash 915885638, now seen corresponding path program 1 times [2019-12-07 11:34:11,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:11,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787194713] [2019-12-07 11:34:11,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:11,994 INFO L264 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:34:11,995 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:11,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:34:11,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:12,000 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:12,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:12,000 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:34:12,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:12,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 11:34:12,022 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:12,023 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:12,023 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:12,023 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2019-12-07 11:34:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:12,031 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:12,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:34:12,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787194713] [2019-12-07 11:34:12,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:12,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 11:34:12,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482857013] [2019-12-07 11:34:12,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:34:12,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:12,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:34:12,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:34:12,037 INFO L87 Difference]: Start difference. First operand 1653 states and 3576 transitions. Second operand 7 states. [2019-12-07 11:34:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:25,360 INFO L93 Difference]: Finished difference Result 3308 states and 9080 transitions. [2019-12-07 11:34:25,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:34:25,361 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-07 11:34:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:25,374 INFO L225 Difference]: With dead ends: 3308 [2019-12-07 11:34:25,374 INFO L226 Difference]: Without dead ends: 1666 [2019-12-07 11:34:25,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:34:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2019-12-07 11:34:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1657. [2019-12-07 11:34:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1657 states. [2019-12-07 11:34:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 3603 transitions. [2019-12-07 11:34:25,439 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 3603 transitions. Word has length 47 [2019-12-07 11:34:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:25,439 INFO L462 AbstractCegarLoop]: Abstraction has 1657 states and 3603 transitions. [2019-12-07 11:34:25,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:34:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 3603 transitions. [2019-12-07 11:34:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 11:34:25,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:25,441 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:34:25,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 11:34:25,642 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:25,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:25,643 INFO L82 PathProgramCache]: Analyzing trace with hash 214285764, now seen corresponding path program 1 times [2019-12-07 11:34:25,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:25,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632070558] [2019-12-07 11:34:25,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:25,802 INFO L264 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:34:25,803 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:25,814 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:25,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632070558] [2019-12-07 11:34:25,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:25,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 11:34:25,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303277597] [2019-12-07 11:34:25,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:34:25,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:25,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:34:25,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:34:25,825 INFO L87 Difference]: Start difference. First operand 1657 states and 3603 transitions. Second operand 5 states. [2019-12-07 11:34:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:25,875 INFO L93 Difference]: Finished difference Result 3352 states and 9743 transitions. [2019-12-07 11:34:25,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:34:25,875 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 11:34:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:25,890 INFO L225 Difference]: With dead ends: 3352 [2019-12-07 11:34:25,890 INFO L226 Difference]: Without dead ends: 1706 [2019-12-07 11:34:25,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:34:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2019-12-07 11:34:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1659. [2019-12-07 11:34:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-12-07 11:34:25,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 3605 transitions. [2019-12-07 11:34:25,982 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 3605 transitions. Word has length 47 [2019-12-07 11:34:25,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:25,982 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 3605 transitions. [2019-12-07 11:34:25,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:34:25,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 3605 transitions. [2019-12-07 11:34:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 11:34:25,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:25,984 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:34:26,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 11:34:26,185 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1192209372, now seen corresponding path program 1 times [2019-12-07 11:34:26,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:26,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931628869] [2019-12-07 11:34:26,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:26,348 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:34:26,349 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:26,354 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:26,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931628869] [2019-12-07 11:34:26,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:26,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:34:26,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391513218] [2019-12-07 11:34:26,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:34:26,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:26,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:34:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:34:26,365 INFO L87 Difference]: Start difference. First operand 1659 states and 3605 transitions. Second operand 4 states. [2019-12-07 11:34:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:26,427 INFO L93 Difference]: Finished difference Result 3450 states and 10080 transitions. [2019-12-07 11:34:26,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:34:26,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 11:34:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:26,443 INFO L225 Difference]: With dead ends: 3450 [2019-12-07 11:34:26,444 INFO L226 Difference]: Without dead ends: 1802 [2019-12-07 11:34:26,452 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:34:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2019-12-07 11:34:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2019-12-07 11:34:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2019-12-07 11:34:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 4323 transitions. [2019-12-07 11:34:26,517 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 4323 transitions. Word has length 48 [2019-12-07 11:34:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:26,518 INFO L462 AbstractCegarLoop]: Abstraction has 1802 states and 4323 transitions. [2019-12-07 11:34:26,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:34:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 4323 transitions. [2019-12-07 11:34:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 11:34:26,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:26,519 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:34:26,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 11:34:26,720 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:26,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:26,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1407247106, now seen corresponding path program 1 times [2019-12-07 11:34:26,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:26,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624669300] [2019-12-07 11:34:26,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:26,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:34:26,898 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:26,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:34:26,901 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:26,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:26,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:26,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:34:26,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:26,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 11:34:26,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:26,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:26,926 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:26,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2019-12-07 11:34:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:26,933 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:26,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:26,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624669300] [2019-12-07 11:34:26,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:26,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 11:34:26,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514031444] [2019-12-07 11:34:26,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:34:26,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:34:26,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:34:26,939 INFO L87 Difference]: Start difference. First operand 1802 states and 4323 transitions. Second operand 7 states. [2019-12-07 11:34:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:40,491 INFO L93 Difference]: Finished difference Result 3738 states and 11958 transitions. [2019-12-07 11:34:40,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:34:40,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 11:34:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:40,511 INFO L225 Difference]: With dead ends: 3738 [2019-12-07 11:34:40,512 INFO L226 Difference]: Without dead ends: 1947 [2019-12-07 11:34:40,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:34:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-12-07 11:34:40,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1899. [2019-12-07 11:34:40,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1899 states. [2019-12-07 11:34:40,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1899 states to 1899 states and 4467 transitions. [2019-12-07 11:34:40,616 INFO L78 Accepts]: Start accepts. Automaton has 1899 states and 4467 transitions. Word has length 49 [2019-12-07 11:34:40,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:40,617 INFO L462 AbstractCegarLoop]: Abstraction has 1899 states and 4467 transitions. [2019-12-07 11:34:40,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:34:40,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 4467 transitions. [2019-12-07 11:34:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 11:34:40,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:40,618 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-12-07 11:34:40,819 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 11:34:40,820 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:40,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:40,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1652458348, now seen corresponding path program 1 times [2019-12-07 11:34:40,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:40,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550133272] [2019-12-07 11:34:40,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:40,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 11:34:40,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:40,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:34:40,990 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:40,992 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:40,992 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:40,992 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:34:41,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:34:41,023 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:41,024 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:34:41,025 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:41,034 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 11:34:41,035 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:41,035 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 11:34:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:41,063 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:41,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:41,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:41,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:41,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:34:41,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550133272] [2019-12-07 11:34:41,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:34:41,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 11:34:41,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603393604] [2019-12-07 11:34:41,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:34:41,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:41,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:34:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:34:41,151 INFO L87 Difference]: Start difference. First operand 1899 states and 4467 transitions. Second operand 13 states. [2019-12-07 11:34:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:34:56,146 INFO L93 Difference]: Finished difference Result 3878 states and 11989 transitions. [2019-12-07 11:34:56,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:34:56,146 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-12-07 11:34:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:34:56,162 INFO L225 Difference]: With dead ends: 3878 [2019-12-07 11:34:56,162 INFO L226 Difference]: Without dead ends: 1990 [2019-12-07 11:34:56,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:34:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2019-12-07 11:34:56,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1965. [2019-12-07 11:34:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1965 states. [2019-12-07 11:34:56,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 4575 transitions. [2019-12-07 11:34:56,252 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 4575 transitions. Word has length 50 [2019-12-07 11:34:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:34:56,252 INFO L462 AbstractCegarLoop]: Abstraction has 1965 states and 4575 transitions. [2019-12-07 11:34:56,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:34:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 4575 transitions. [2019-12-07 11:34:56,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 11:34:56,254 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:34:56,254 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 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] [2019-12-07 11:34:56,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 11:34:56,455 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:34:56,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:34:56,456 INFO L82 PathProgramCache]: Analyzing trace with hash 847174168, now seen corresponding path program 1 times [2019-12-07 11:34:56,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:34:56,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676322689] [2019-12-07 11:34:56,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 11:34:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:56,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:34:56,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:56,713 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:34:56,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:56,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:56,716 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:56,716 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-12-07 11:34:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 11:34:56,756 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:56,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:56,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:56,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:34:56,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:56,820 INFO L614 ElimStorePlain]: treesize reduction 2, result has 33.3 percent of original size [2019-12-07 11:34:56,820 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:56,820 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2019-12-07 11:34:56,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:34:56,850 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:56,850 INFO L614 ElimStorePlain]: treesize reduction 2, result has 33.3 percent of original size [2019-12-07 11:34:56,851 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:56,851 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2019-12-07 11:34:56,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:34:56,874 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:56,875 INFO L614 ElimStorePlain]: treesize reduction 2, result has 33.3 percent of original size [2019-12-07 11:34:56,875 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:56,875 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2019-12-07 11:34:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 11:34:56,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676322689] [2019-12-07 11:34:56,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [132225971] [2019-12-07 11:34:56,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/cvc4 Starting monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:34:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:57,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:34:57,211 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:57,215 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:34:57,215 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:57,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:34:57,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:7 [2019-12-07 11:34:57,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 11:34:57,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:57,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,238 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:3 [2019-12-07 11:34:57,342 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:57,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-12-07 11:34:57,342 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,361 INFO L614 ElimStorePlain]: treesize reduction 3, result has 82.4 percent of original size [2019-12-07 11:34:57,362 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:4 [2019-12-07 11:34:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-12-07 11:34:57,368 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:57,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:57,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:57,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2019-12-07 11:34:57,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:57,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:57,458 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:34:57,463 INFO L614 ElimStorePlain]: treesize reduction 49, result has 2.0 percent of original size [2019-12-07 11:34:57,463 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,463 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:1 [2019-12-07 11:34:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 11:34:57,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496720120] [2019-12-07 11:34:57,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:34:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:34:57,632 INFO L264 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:34:57,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:34:57,637 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:34:57,637 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:34:57,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-12-07 11:34:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 11:34:57,644 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:34:57,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:57,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:34:57,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:34:57,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,689 INFO L614 ElimStorePlain]: treesize reduction 2, result has 33.3 percent of original size [2019-12-07 11:34:57,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,689 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2019-12-07 11:34:57,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:34:57,716 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,717 INFO L614 ElimStorePlain]: treesize reduction 2, result has 33.3 percent of original size [2019-12-07 11:34:57,717 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,717 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2019-12-07 11:34:57,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:34:57,719 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,720 INFO L614 ElimStorePlain]: treesize reduction 2, result has 33.3 percent of original size [2019-12-07 11:34:57,720 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:34:57,720 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2019-12-07 11:34:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-12-07 11:34:57,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 11:34:57,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9, 6, 6, 6] total 14 [2019-12-07 11:34:57,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303514942] [2019-12-07 11:34:57,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:34:57,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:34:57,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:34:57,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:34:57,725 INFO L87 Difference]: Start difference. First operand 1965 states and 4575 transitions. Second operand 14 states. [2019-12-07 11:35:34,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:34,579 INFO L93 Difference]: Finished difference Result 6955 states and 24938 transitions. [2019-12-07 11:35:34,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 11:35:34,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-07 11:35:34,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:34,631 INFO L225 Difference]: With dead ends: 6955 [2019-12-07 11:35:34,631 INFO L226 Difference]: Without dead ends: 5000 [2019-12-07 11:35:34,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=716, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:35:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5000 states. [2019-12-07 11:35:34,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5000 to 4854. [2019-12-07 11:35:34,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4854 states. [2019-12-07 11:35:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4854 states to 4854 states and 15342 transitions. [2019-12-07 11:35:34,956 INFO L78 Accepts]: Start accepts. Automaton has 4854 states and 15342 transitions. Word has length 68 [2019-12-07 11:35:34,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:34,956 INFO L462 AbstractCegarLoop]: Abstraction has 4854 states and 15342 transitions. [2019-12-07 11:35:34,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:35:34,956 INFO L276 IsEmpty]: Start isEmpty. Operand 4854 states and 15342 transitions. [2019-12-07 11:35:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:35:34,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:34,959 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-12-07 11:35:35,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 cvc4 --incremental --print-success --lang smt --rewrite-divk,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 mathsat -unsat_core_generation=3 [2019-12-07 11:35:35,561 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:35,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:35,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1327114492, now seen corresponding path program 1 times [2019-12-07 11:35:35,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:35:35,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079271780] [2019-12-07 11:35:35,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 11:35:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:35,727 INFO L264 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:35:35,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:35:35,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:35:35,732 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:35:35,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:35,734 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:35:35,734 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:35:35,755 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:35:35,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:35:35,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:35,757 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:35:35,757 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 11:35:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:35:35,772 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:35:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:35:35,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079271780] [2019-12-07 11:35:35,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:35,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-07 11:35:35,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15144739] [2019-12-07 11:35:35,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:35:35,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:35:35,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:35:35,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:35:35,778 INFO L87 Difference]: Start difference. First operand 4854 states and 15342 transitions. Second operand 8 states. [2019-12-07 11:35:49,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:35:49,391 INFO L93 Difference]: Finished difference Result 9840 states and 41449 transitions. [2019-12-07 11:35:49,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:35:49,392 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-07 11:35:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:35:49,444 INFO L225 Difference]: With dead ends: 9840 [2019-12-07 11:35:49,444 INFO L226 Difference]: Without dead ends: 5001 [2019-12-07 11:35:49,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:35:49,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5001 states. [2019-12-07 11:35:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5001 to 4989. [2019-12-07 11:35:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4989 states. [2019-12-07 11:35:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4989 states to 4989 states and 15550 transitions. [2019-12-07 11:35:49,804 INFO L78 Accepts]: Start accepts. Automaton has 4989 states and 15550 transitions. Word has length 56 [2019-12-07 11:35:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:35:49,804 INFO L462 AbstractCegarLoop]: Abstraction has 4989 states and 15550 transitions. [2019-12-07 11:35:49,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:35:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4989 states and 15550 transitions. [2019-12-07 11:35:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:35:49,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:35:49,807 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-12-07 11:35:50,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 11:35:50,007 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:35:50,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:35:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1709178951, now seen corresponding path program 1 times [2019-12-07 11:35:50,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:35:50,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564950116] [2019-12-07 11:35:50,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 11:35:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:35:50,196 INFO L264 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 11:35:50,198 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:35:50,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:35:50,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:35:50,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:35:50,203 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:35:50,203 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:35:50,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:50,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:35:50,226 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:35:50,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:35:50,227 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:35:50,232 INFO L614 ElimStorePlain]: treesize reduction 11, result has 15.4 percent of original size [2019-12-07 11:35:50,233 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:35:50,233 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:2 [2019-12-07 11:35:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:35:50,241 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:35:50,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:35:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:35:50,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564950116] [2019-12-07 11:35:50,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:35:50,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-12-07 11:35:50,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852004047] [2019-12-07 11:35:50,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:35:50,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:35:50,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:35:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:35:50,289 INFO L87 Difference]: Start difference. First operand 4989 states and 15550 transitions. Second operand 11 states. [2019-12-07 11:36:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:36:07,882 INFO L93 Difference]: Finished difference Result 9855 states and 41368 transitions. [2019-12-07 11:36:07,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:36:07,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2019-12-07 11:36:07,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:36:07,932 INFO L225 Difference]: With dead ends: 9855 [2019-12-07 11:36:07,932 INFO L226 Difference]: Without dead ends: 4881 [2019-12-07 11:36:07,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:36:07,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2019-12-07 11:36:08,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4877. [2019-12-07 11:36:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2019-12-07 11:36:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 15363 transitions. [2019-12-07 11:36:08,291 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 15363 transitions. Word has length 57 [2019-12-07 11:36:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:36:08,292 INFO L462 AbstractCegarLoop]: Abstraction has 4877 states and 15363 transitions. [2019-12-07 11:36:08,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:36:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 15363 transitions. [2019-12-07 11:36:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 11:36:08,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:36:08,294 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-12-07 11:36:08,495 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 11:36:08,495 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:36:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:36:08,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1385684304, now seen corresponding path program 1 times [2019-12-07 11:36:08,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:36:08,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39280589] [2019-12-07 11:36:08,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 11:36:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:08,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:36:08,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:36:08,622 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:36:08,622 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:36:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 11:36:08,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39280589] [2019-12-07 11:36:08,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:36:08,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 11:36:08,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892734845] [2019-12-07 11:36:08,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:36:08,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:36:08,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:36:08,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:36:08,630 INFO L87 Difference]: Start difference. First operand 4877 states and 15363 transitions. Second operand 4 states. [2019-12-07 11:36:08,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:36:08,803 INFO L93 Difference]: Finished difference Result 9745 states and 41052 transitions. [2019-12-07 11:36:08,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:36:08,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 11:36:08,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:36:08,856 INFO L225 Difference]: With dead ends: 9745 [2019-12-07 11:36:08,856 INFO L226 Difference]: Without dead ends: 4883 [2019-12-07 11:36:08,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:36:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-12-07 11:36:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4877. [2019-12-07 11:36:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4877 states. [2019-12-07 11:36:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 15348 transitions. [2019-12-07 11:36:09,191 INFO L78 Accepts]: Start accepts. Automaton has 4877 states and 15348 transitions. Word has length 57 [2019-12-07 11:36:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:36:09,191 INFO L462 AbstractCegarLoop]: Abstraction has 4877 states and 15348 transitions. [2019-12-07 11:36:09,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:36:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 4877 states and 15348 transitions. [2019-12-07 11:36:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:36:09,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:36:09,194 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-12-07 11:36:09,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 11:36:09,395 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:36:09,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:36:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash 171104757, now seen corresponding path program 1 times [2019-12-07 11:36:09,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:36:09,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071347685] [2019-12-07 11:36:09,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 11:36:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:09,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:36:09,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:36:09,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:36:09,585 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:36:09,587 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:36:09,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:36:09,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 11:36:09,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 11:36:09,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:36:09,605 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:36:09,605 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:36:09,605 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-12-07 11:36:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:36:09,615 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:36:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:36:09,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071347685] [2019-12-07 11:36:09,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:36:09,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 11:36:09,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926119347] [2019-12-07 11:36:09,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:36:09,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:36:09,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:36:09,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:36:09,649 INFO L87 Difference]: Start difference. First operand 4877 states and 15348 transitions. Second operand 10 states. [2019-12-07 11:36:29,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:36:29,222 INFO L93 Difference]: Finished difference Result 12180 states and 60788 transitions. [2019-12-07 11:36:29,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:36:29,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-07 11:36:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:36:29,326 INFO L225 Difference]: With dead ends: 12180 [2019-12-07 11:36:29,326 INFO L226 Difference]: Without dead ends: 7318 [2019-12-07 11:36:29,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:36:29,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7318 states. [2019-12-07 11:36:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7318 to 7273. [2019-12-07 11:36:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-12-07 11:36:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 30533 transitions. [2019-12-07 11:36:30,110 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 30533 transitions. Word has length 58 [2019-12-07 11:36:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:36:30,111 INFO L462 AbstractCegarLoop]: Abstraction has 7273 states and 30533 transitions. [2019-12-07 11:36:30,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:36:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 30533 transitions. [2019-12-07 11:36:30,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 11:36:30,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:36:30,115 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-12-07 11:36:30,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 11:36:30,316 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:36:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:36:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1857161727, now seen corresponding path program 1 times [2019-12-07 11:36:30,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:36:30,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396339755] [2019-12-07 11:36:30,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 11:36:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:30,481 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:36:30,482 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:36:30,553 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-12-07 11:36:30,554 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:36:30,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:36:30,563 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:36:30,563 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2019-12-07 11:36:30,634 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:36:30,635 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:36:30,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:30,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:30,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:30,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:30,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:36:30,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:30,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:36:30,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:36:30,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:30,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:30,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:30,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:36:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:36:30,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396339755] [2019-12-07 11:36:30,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [603433501] [2019-12-07 11:36:30,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:36:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:31,175 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:36:31,176 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:36:31,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 11:36:31,179 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:36:31,181 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:36:31,181 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 11:36:31,181 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:7 [2019-12-07 11:36:31,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-12-07 11:36:31,202 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:36:31,203 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:36:31,203 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:36:31,204 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:3 [2019-12-07 11:36:31,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:36:31,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 23 [2019-12-07 11:36:31,356 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:36:31,370 INFO L614 ElimStorePlain]: treesize reduction 3, result has 82.4 percent of original size [2019-12-07 11:36:31,371 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:36:31,371 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:23, output treesize:4 [2019-12-07 11:36:31,392 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 11:36:31,392 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:36:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:31,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:31,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:31,616 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:36:31,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971594706] [2019-12-07 11:36:31,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:36:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:36:31,739 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:36:31,740 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:36:31,765 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-12-07 11:36:31,765 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:36:31,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:36:31,767 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:36:31,767 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-12-07 11:36:31,770 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:36:31,770 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:36:31,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:31,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:31,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:36:31,889 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 11:36:31,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2019-12-07 11:36:31,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10, 7, 7, 7] total 26 [2019-12-07 11:36:31,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509158572] [2019-12-07 11:36:31,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:36:31,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 11:36:31,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:36:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:36:31,891 INFO L87 Difference]: Start difference. First operand 7273 states and 30533 transitions. Second operand 26 states. [2019-12-07 11:37:20,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:37:20,107 INFO L93 Difference]: Finished difference Result 19428 states and 123710 transitions. [2019-12-07 11:37:20,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 11:37:20,108 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 60 [2019-12-07 11:37:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:37:20,290 INFO L225 Difference]: With dead ends: 19428 [2019-12-07 11:37:20,290 INFO L226 Difference]: Without dead ends: 12062 [2019-12-07 11:37:20,391 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 343 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=770, Invalid=3136, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 11:37:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12062 states. [2019-12-07 11:37:21,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12062 to 11362. [2019-12-07 11:37:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11362 states. [2019-12-07 11:37:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11362 states to 11362 states and 57714 transitions. [2019-12-07 11:37:22,016 INFO L78 Accepts]: Start accepts. Automaton has 11362 states and 57714 transitions. Word has length 60 [2019-12-07 11:37:22,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:37:22,016 INFO L462 AbstractCegarLoop]: Abstraction has 11362 states and 57714 transitions. [2019-12-07 11:37:22,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:37:22,016 INFO L276 IsEmpty]: Start isEmpty. Operand 11362 states and 57714 transitions. [2019-12-07 11:37:22,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:37:22,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:37:22,025 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-12-07 11:37:22,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3,34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:37:22,627 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:37:22,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:37:22,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1099686263, now seen corresponding path program 1 times [2019-12-07 11:37:22,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 11:37:22,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768135599] [2019-12-07 11:37:22,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 11:37:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:37:23,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 110 conjunts are in the unsatisfiable core [2019-12-07 11:37:23,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:37:23,797 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 11:37:23,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 11:37:23,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:37:23,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:23,805 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:37:23,806 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:21 [2019-12-07 11:37:23,821 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_314|, |v_#memory_$Pointer$.offset_273|, |v_#memory_$Pointer$.base_278|], 2=[|v_#memory_$Pointer$.offset_269|, |v_#memory_$Pointer$.base_272|, |v_#memory_$Pointer$.base_270|, |v_#memory_$Pointer$.offset_270|, |v_#memory_$Pointer$.offset_272|, |v_#memory_$Pointer$.base_269|], 6=[|v_#memory_$Pointer$.base_271|, |v_#memory_$Pointer$.offset_271|]} [2019-12-07 11:37:24,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:24,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:24,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:24,761 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:24,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:24,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:24,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:25,088 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:25,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:25,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:25,318 INFO L237 Elim1Store]: Index analysis took 1204 ms [2019-12-07 11:37:25,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 56 [2019-12-07 11:37:25,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:37:35,356 WARN L192 SmtUtils]: Spent 10.04 s on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-12-07 11:37:35,357 INFO L614 ElimStorePlain]: treesize reduction 4, result has 98.8 percent of original size [2019-12-07 11:37:35,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:35,916 INFO L237 Elim1Store]: Index analysis took 434 ms [2019-12-07 11:37:36,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2019-12-07 11:37:36,371 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:37:39,552 WARN L192 SmtUtils]: Spent 3.18 s on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 11:37:39,553 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:39,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:40,225 INFO L237 Elim1Store]: Index analysis took 432 ms [2019-12-07 11:37:40,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2019-12-07 11:37:40,615 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:37:43,695 WARN L192 SmtUtils]: Spent 3.08 s on a formula simplification that was a NOOP. DAG size: 99 [2019-12-07 11:37:43,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:43,735 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:37:46,197 WARN L192 SmtUtils]: Spent 2.46 s on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 11:37:46,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:46,223 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:37:47,853 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 91 [2019-12-07 11:37:47,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:47,870 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:37:49,298 WARN L192 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 11:37:49,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:49,310 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:37:51,000 WARN L192 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 11:37:51,000 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:51,010 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:37:52,375 WARN L192 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 81 [2019-12-07 11:37:52,375 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:52,390 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:37:52,981 WARN L192 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 11:37:52,981 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:52,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:52,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:52,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:52,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:52,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:52,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:52,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:52,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:52,994 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:37:53,013 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:37:53,014 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 145 [2019-12-07 11:37:53,014 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 11:37:53,464 WARN L192 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-12-07 11:37:53,465 INFO L614 ElimStorePlain]: treesize reduction 24, result has 87.8 percent of original size [2019-12-07 11:37:53,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:53,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:53,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:53,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:53,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:37:53,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:09,879 WARN L192 SmtUtils]: Spent 16.40 s on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-12-07 11:38:09,880 INFO L343 Elim1Store]: treesize reduction 47, result has 70.3 percent of original size [2019-12-07 11:38:09,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 153 [2019-12-07 11:38:09,882 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:10,036 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-12-07 11:38:10,037 INFO L614 ElimStorePlain]: treesize reduction 94, result has 56.3 percent of original size [2019-12-07 11:38:10,037 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 11 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:38:10,037 INFO L239 ElimStorePlain]: Needed 12 recursive calls to eliminate 12 variables, input treesize:389, output treesize:80 [2019-12-07 11:38:10,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:10,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:10,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 103 [2019-12-07 11:38:10,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:10,502 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-12-07 11:38:10,502 INFO L614 ElimStorePlain]: treesize reduction 46, result has 75.4 percent of original size [2019-12-07 11:38:10,503 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_279|, |v_#memory_$Pointer$.offset_274|], 30=[|v_#memory_int_315|]} [2019-12-07 11:38:10,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2019-12-07 11:38:10,511 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:10,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:10,608 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 11:38:10,609 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:10,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:10,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:10,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:10,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:10,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:10,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:10,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:10,672 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:38:10,679 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:10,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 86 [2019-12-07 11:38:10,680 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:10,754 INFO L614 ElimStorePlain]: treesize reduction 14, result has 88.2 percent of original size [2019-12-07 11:38:10,754 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 11:38:10,754 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:105 [2019-12-07 11:38:11,264 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_280|, |v_#memory_$Pointer$.offset_275|], 40=[|v_#memory_int_316|]} [2019-12-07 11:38:11,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,284 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 28 [2019-12-07 11:38:11,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:11,414 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 11:38:11,414 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:11,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-12-07 11:38:11,424 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:11,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:11,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,506 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:38:11,542 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:11,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 115 [2019-12-07 11:38:11,543 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:11,638 INFO L614 ElimStorePlain]: treesize reduction 44, result has 70.7 percent of original size [2019-12-07 11:38:11,638 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:11,638 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:147, output treesize:99 [2019-12-07 11:38:11,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,790 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:11,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 100 [2019-12-07 11:38:11,791 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:11,914 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-07 11:38:11,914 INFO L614 ElimStorePlain]: treesize reduction 60, result has 67.7 percent of original size [2019-12-07 11:38:11,915 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 28=[|#memory_int|]} [2019-12-07 11:38:11,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 11:38:11,924 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:11,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:11,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 11:38:11,974 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:38:11,981 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:11,981 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 35 [2019-12-07 11:38:11,981 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:12,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:12,004 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:12,004 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:131, output treesize:60 [2019-12-07 11:38:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 11:38:12,073 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:38:12,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:38:12,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:38:12,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2019-12-07 11:38:12,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 11:38:12,157 INFO L614 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-12-07 11:38:12,157 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 11:38:12,157 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-12-07 11:38:12,230 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:12,231 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:12,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:12,235 INFO L502 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_289| vanished before elimination [2019-12-07 11:38:12,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 11:38:12,236 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:109, output treesize:7 [2019-12-07 11:38:12,238 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_300|], 2=[|v_#memory_$Pointer$.base_273|, |v_#memory_$Pointer$.base_276|, |v_#memory_$Pointer$.base_275|, |v_#memory_$Pointer$.base_274|]} [2019-12-07 11:38:12,252 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:12,265 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:12,568 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 11:38:12,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:12,582 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:12,590 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:12,766 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 11:38:12,766 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:12,774 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:12,779 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:12,902 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 11:38:12,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:12,908 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:12,911 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:12,930 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:12,933 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:12,934 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:12,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:12,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 11:38:12,938 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:193, output treesize:7 [2019-12-07 11:38:13,273 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:13,275 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:13,293 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:13,294 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 11:38:13,294 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-12-07 11:38:13,505 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:13,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:13,535 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:13,550 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:13,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:13,551 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:48 [2019-12-07 11:38:15,693 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 11:38:17,796 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 11:38:17,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:38:19,895 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 11:38:22,000 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 11:38:22,009 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:22,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:22,070 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:22,116 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:22,117 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:22,117 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:121, output treesize:105 [2019-12-07 11:38:26,295 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_269|, |v_#memory_$Pointer$.base_272|, |v_#memory_$Pointer$.base_270|, |v_#memory_$Pointer$.offset_270|, |v_#memory_$Pointer$.base_304|, |v_#memory_$Pointer$.offset_272|, |v_#memory_$Pointer$.offset_295|, |v_#memory_$Pointer$.base_269|], 6=[|v_#memory_$Pointer$.base_271|, |v_#memory_$Pointer$.offset_271|], 15=[|v_#memory_int_314|]} [2019-12-07 11:38:27,348 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:38:27,599 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:27,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 10 [2019-12-07 11:38:27,599 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:33,807 WARN L192 SmtUtils]: Spent 6.21 s on a formula simplification that was a NOOP. DAG size: 152 [2019-12-07 11:38:33,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:34,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:38:35,248 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:35,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 10 [2019-12-07 11:38:35,249 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 11:38:42,724 WARN L192 SmtUtils]: Spent 7.47 s on a formula simplification that was a NOOP. DAG size: 146 [2019-12-07 11:38:42,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:42,829 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:48,839 WARN L192 SmtUtils]: Spent 6.01 s on a formula simplification that was a NOOP. DAG size: 141 [2019-12-07 11:38:48,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:49,114 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:53,469 WARN L192 SmtUtils]: Spent 4.36 s on a formula simplification that was a NOOP. DAG size: 136 [2019-12-07 11:38:53,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:53,509 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:56,137 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification that was a NOOP. DAG size: 132 [2019-12-07 11:38:56,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:38:56,207 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:38:59,733 WARN L192 SmtUtils]: Spent 3.52 s on a formula simplification that was a NOOP. DAG size: 128 [2019-12-07 11:38:59,733 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:39:00,053 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:39:04,467 WARN L192 SmtUtils]: Spent 4.41 s on a formula simplification that was a NOOP. DAG size: 124 [2019-12-07 11:39:04,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:39:04,529 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:39:07,588 WARN L192 SmtUtils]: Spent 3.06 s on a formula simplification that was a NOOP. DAG size: 119 [2019-12-07 11:39:07,588 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:39:07,602 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:39:08,875 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 11:39:08,875 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:39:08,882 INFO L534 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 11:39:09,600 WARN L192 SmtUtils]: Spent 717.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 11:39:09,600 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:39:09,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:09,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:09,607 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:09,611 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:09,611 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:09,612 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:30,371 WARN L192 SmtUtils]: Spent 20.74 s on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-12-07 11:39:30,372 INFO L343 Elim1Store]: treesize reduction 308, result has 43.7 percent of original size [2019-12-07 11:39:30,372 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 1074 treesize of output 962 [2019-12-07 11:39:30,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 11:39:30,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 11:39:30,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,455 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 11:39:30,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 758 treesize of output 766 [2019-12-07 11:39:30,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 11:39:30,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 11:39:30,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 11:39:30,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:39:30,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:30,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:30,859 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:30,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:30,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:30,860 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 11:39:30,861 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_85, v_arrayElimCell_86], 1=[v_arrayElimCell_84]} [2019-12-07 11:39:30,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768135599] [2019-12-07 11:39:30,897 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@506600fd [2019-12-07 11:39:30,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [447924856] [2019-12-07 11:39:30,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/cvc4 Starting monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:39:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:31,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 11:39:31,677 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@506600fd [2019-12-07 11:39:31,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059508303] [2019-12-07 11:39:31,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_513036b3-0601-496d-b17f-911a7fccb1bd/bin/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:39:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:39:31,917 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 149 conjunts are in the unsatisfiable core [2019-12-07 11:39:31,918 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@506600fd [2019-12-07 11:39:31,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:39:31,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 11:39:31,918 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 11:39:31,918 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:39:32,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3,37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 11:39:32,544 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 11:39:32,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:39:32 BoogieIcfgContainer [2019-12-07 11:39:32,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:39:32,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:39:32,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:39:32,545 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:39:32,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:29:36" (3/4) ... [2019-12-07 11:39:32,547 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:39:32,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:39:32,548 INFO L168 Benchmark]: Toolchain (without parser) took 604735.60 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 617.6 MB). Free memory was 947.0 MB in the beginning and 640.6 MB in the end (delta: 306.5 MB). Peak memory consumption was 924.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:32,548 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:39:32,548 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -114.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:32,549 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:32,549 INFO L168 Benchmark]: Boogie Preprocessor took 41.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:39:32,549 INFO L168 Benchmark]: RCFGBuilder took 8372.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.2 MB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:32,549 INFO L168 Benchmark]: TraceAbstraction took 595798.42 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 511.2 MB). Free memory was 975.2 MB in the beginning and 653.8 MB in the end (delta: 321.4 MB). Peak memory consumption was 832.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:32,549 INFO L168 Benchmark]: Witness Printer took 2.65 ms. Allocated memory is still 1.6 GB. Free memory was 653.8 MB in the beginning and 640.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:39:32,550 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.78 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -114.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 8372.61 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.2 MB in the end (delta: 79.2 MB). Peak memory consumption was 79.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 595798.42 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 511.2 MB). Free memory was 975.2 MB in the beginning and 653.8 MB in the end (delta: 321.4 MB). Peak memory consumption was 832.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.65 ms. Allocated memory is still 1.6 GB. Free memory was 653.8 MB in the beginning and 640.6 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 919]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L768] user_t *user; [L964] user = malloc(sizeof(user_t)) [L955] user->info = calloc(1, sizeof(info_t)) [L956] user->message.id = 11 [L957] EXPR user->info [L957] user->info->is_valid = 0 [L958] user->status = AS_NULL [L959] user->user_id = 11 [L960] user->timeout = 3 [L966] event_t e = {0}; [L967] e.primitive = _EVENT_START [L968] CALL event_precess(&e) [L932] EXPR user->status [L932] sys_state_t status = user->status; [L933] int rc = -1; [L934] COND TRUE status < AS_STATE_MAX [L936] case AS_NULL: [L937] CALL ASNull(e) [L827] EXPR e->primitive [L827] e_primitive_t primitive = e->primitive; [L828] COND TRUE primitive == _EVENT_START [L803] COND TRUE status < AS_STATE_MAX [L804] EXPR user->status [L804] COND TRUE user->status != status [L805] user->status = status [L806] return 10; [L830] CALL system_initialize() [L818] event_t e = {0}; [L819] EXPR user->info [L819] EXPR user->info->is_valid [L819] COND FALSE !(!user->info->is_valid) [L822] e.primitive = _EVENT_OPEN [L824] CALL event_precess(&e) [L932] EXPR user->status [L932] sys_state_t status = user->status; [L933] int rc = -1; [L934] COND TRUE status < AS_STATE_MAX [L936] case AS_NULL: [L939] case AS_START: [L940] CALL ASStart(e) [L870] EXPR e->primitive [L870] e_primitive_t primitive = e->primitive; [L871] int rc = -1; [L873] case _EVENT_OPEN: [L874] message_t *message = &user->message; [L875] message = calloc(0,sizeof(*message)) [L876] message->id = 4 [L877] message->type = M_OPEN [L858] message->index = 3 [L859] message->time = 2 [L860] message->data.length = 15 [L861] message->data.length [L879] CALL, EXPR message_send() [L771] message_t* message = &user->message; [L772] message->type [L773] case M_HELLO: [L774] EXPR user->info [L774] EXPR message->u.hello.data.value[0] [L774] user->info->identifies.identify[0].id1 = message->u.hello.data.value[0] [L775] EXPR user->info [L775] EXPR message->u.hello.data.value[1] [L775] user->info->identifies.identify[0].id2 = message->u.hello.data.value[1] [L776] EXPR user->info [L776] EXPR message->u.hello.data.value[2] [L776] user->info->identifies.identify[0].id3 = message->u.hello.data.value[2] [L777] EXPR user->info [L777] EXPR message->u.hello.data.value[3] [L777] user->info->identifies.identify[0].id4 = message->u.hello.data.value[3] [L792] EXPR user->timeout [L792] user->timeout-- [L793] EXPR user->timeout [L793] COND FALSE !(user->timeout <= 0) [L798] return 0; [L879] RET, EXPR message_send() [L879] rc = message_send() [L880] COND TRUE rc == 0 [L803] COND TRUE status < AS_STATE_MAX [L804] EXPR user->status [L804] COND TRUE user->status != status [L805] user->status = status [L806] return 10; [L882] e->primitive = _EVENT_HELLO [L884] CALL event_precess(e) [L932] EXPR user->status [L932] sys_state_t status = user->status; [L933] int rc = -1; [L934] COND TRUE status < AS_STATE_MAX [L936] case AS_NULL: [L939] case AS_START: [L942] case AS_IDLE: [L943] CALL ASIdle(e) [L906] EXPR e->primitive [L906] e_primitive_t primitive = e->primitive; [L907] int rc = 0; [L909] case _EVENT_HELLO: [L910] message_t *message = &user->message; [L911] message = calloc(0,sizeof(*message)) [L912] message->id = 4 [L913] message->type = M_HELLO [L852] message->index = 2 [L853] message->operations = 2 [L854] message->data.length = 15 [L915] CALL, EXPR message_send() [L771] message_t* message = &user->message; [L772] message->type [L773] case M_HELLO: [L774] EXPR user->info [L774] EXPR message->u.hello.data.value[0] [L774] user->info->identifies.identify[0].id1 = message->u.hello.data.value[0] [L775] EXPR user->info [L775] EXPR message->u.hello.data.value[1] [L775] user->info->identifies.identify[0].id2 = message->u.hello.data.value[1] [L776] EXPR user->info [L776] EXPR message->u.hello.data.value[2] [L776] user->info->identifies.identify[0].id3 = message->u.hello.data.value[2] [L777] EXPR user->info [L777] EXPR message->u.hello.data.value[3] [L777] user->info->identifies.identify[0].id4 = message->u.hello.data.value[3] [L792] EXPR user->timeout [L792] user->timeout-- [L793] EXPR user->timeout [L793] COND FALSE !(user->timeout <= 0) [L798] return 0; [L915] RET, EXPR message_send() [L915] rc = message_send() [L916] CALL event_precess(e) [L932] EXPR user->status [L932] sys_state_t status = user->status; [L933] int rc = -1; [L934] COND TRUE status < AS_STATE_MAX [L936] case AS_NULL: [L939] case AS_START: [L942] case AS_IDLE: [L943] CALL ASIdle(e) [L906] EXPR e->primitive [L906] e_primitive_t primitive = e->primitive; [L907] int rc = 0; [L909] case _EVENT_HELLO: [L918] case _EVENT_OPEN: [L919] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 124 locations, 1 error locations. Result: UNKNOWN, OverallTime: 595.7s, OverallIterations: 30, TraceHistogramMax: 5, AutomataDifference: 445.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5406 SDtfs, 4120 SDslu, 25613 SDs, 0 SdLazy, 11583 SolverSat, 1655 SolverUnsat, 141 SolverUnknown, 0 SolverNotchecked, 430.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3098 GetRequests, 2706 SyntacticMatches, 35 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11362occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 1485 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1498 NumberOfCodeBlocks, 1498 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2930 ConstructedInterpolants, 16 QuantifiedInterpolants, 388409 SizeOfPredicates, 307 NumberOfNonLiveVariables, 9299 ConjunctsInSsa, 396 ConjunctsInUnsatCore, 66 InterpolantComputations, 52 PerfectInterpolantSequences, 946/984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...