./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/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 b18fe0627204ab4c483aeb119f16f48fd5019cde ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/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 b18fe0627204ab4c483aeb119f16f48fd5019cde ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:15:56,702 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:15:56,703 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:15:56,710 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:15:56,710 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:15:56,711 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:15:56,711 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:15:56,713 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:15:56,714 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:15:56,714 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:15:56,715 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:15:56,715 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:15:56,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:15:56,716 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:15:56,717 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:15:56,718 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:15:56,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:15:56,719 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:15:56,721 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:15:56,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:15:56,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:15:56,723 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:15:56,725 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:15:56,725 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:15:56,725 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:15:56,726 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:15:56,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:15:56,727 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:15:56,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:15:56,728 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:15:56,728 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:15:56,729 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:15:56,729 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:15:56,729 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:15:56,730 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:15:56,730 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:15:56,731 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 05:15:56,740 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:15:56,741 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:15:56,741 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:15:56,741 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:15:56,742 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:15:56,742 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:15:56,742 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:15:56,742 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:15:56,742 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:15:56,742 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:15:56,742 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:15:56,743 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:15:56,743 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:15:56,743 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:15:56,743 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:15:56,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:15:56,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:15:56,744 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:15:56,744 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:15:56,744 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:15:56,744 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:15:56,744 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:15:56,744 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:15:56,745 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:15:56,745 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:15:56,745 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:15:56,745 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:15:56,745 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:15:56,745 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:15:56,745 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:15:56,746 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:15:56,746 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:15:56,746 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:15:56,746 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:15:56,746 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:15:56,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:15:56,746 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:15:56,747 INFO L133 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/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/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 -> b18fe0627204ab4c483aeb119f16f48fd5019cde [2018-11-23 05:15:56,767 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:15:56,776 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:15:56,777 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:15:56,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:15:56,779 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:15:56,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:15:56,815 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data/cc95037de/3bc05b15a61c429abedd377e99423b0e/FLAG1ecab2c0d [2018-11-23 05:15:57,196 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:15:57,196 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:15:57,204 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data/cc95037de/3bc05b15a61c429abedd377e99423b0e/FLAG1ecab2c0d [2018-11-23 05:15:57,575 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data/cc95037de/3bc05b15a61c429abedd377e99423b0e [2018-11-23 05:15:57,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:15:57,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:15:57,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:15:57,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:15:57,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:15:57,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3afbb91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57, skipping insertion in model container [2018-11-23 05:15:57,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:15:57,621 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:15:57,823 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:15:57,831 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:15:57,911 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:15:57,937 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:15:57,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57 WrapperNode [2018-11-23 05:15:57,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:15:57,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:15:57,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:15:57,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:15:57,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,957 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:15:57,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:15:57,957 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:15:57,957 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:15:57,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... [2018-11-23 05:15:57,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:15:57,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:15:57,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:15:57,978 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:15:57,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/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 [2018-11-23 05:15:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-23 05:15:58,014 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-23 05:15:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 05:15:58,014 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 05:15:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:15:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:15:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-23 05:15:58,014 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-23 05:15:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 05:15:58,014 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 05:15:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 05:15:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 05:15:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:15:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 05:15:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 05:15:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:15:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:15:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:15:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:15:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:15:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:15:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:15:58,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:15:58,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:15:58,214 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:15:58,214 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 05:15:58,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:15:58 BoogieIcfgContainer [2018-11-23 05:15:58,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:15:58,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:15:58,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:15:58,218 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:15:58,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:15:57" (1/3) ... [2018-11-23 05:15:58,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec6606b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:15:58, skipping insertion in model container [2018-11-23 05:15:58,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:15:57" (2/3) ... [2018-11-23 05:15:58,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ec6606b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:15:58, skipping insertion in model container [2018-11-23 05:15:58,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:15:58" (3/3) ... [2018-11-23 05:15:58,220 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:15:58,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:15:58,230 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:15:58,239 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:15:58,257 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:15:58,257 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:15:58,257 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:15:58,258 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:15:58,258 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:15:58,258 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:15:58,258 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:15:58,258 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:15:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-23 05:15:58,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:15:58,275 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:15:58,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:15:58,277 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:15:58,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:15:58,281 INFO L82 PathProgramCache]: Analyzing trace with hash -43549588, now seen corresponding path program 1 times [2018-11-23 05:15:58,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:15:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:15:58,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:15:58,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:15:58,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:15:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:58,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:15:58,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:15:58,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:15:58,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:15:58,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:15:58,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:15:58,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:15:58,441 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-11-23 05:15:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:15:58,524 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2018-11-23 05:15:58,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:15:58,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 05:15:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:15:58,534 INFO L225 Difference]: With dead ends: 97 [2018-11-23 05:15:58,534 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 05:15:58,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:15:58,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 05:15:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-11-23 05:15:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 05:15:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 05:15:58,573 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2018-11-23 05:15:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:15:58,573 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 05:15:58,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:15:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 05:15:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 05:15:58,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:15:58,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:15:58,575 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:15:58,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:15:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1735963221, now seen corresponding path program 1 times [2018-11-23 05:15:58,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:15:58,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:15:58,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:15:58,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:15:58,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:15:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:15:58,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:15:58,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:15:58,651 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-23 05:15:58,653 INFO L202 CegarAbsIntRunner]: [15], [17], [23], [32], [40], [42], [45], [55], [63], [64], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [129], [130], [133], [134], [135], [136], [137] [2018-11-23 05:15:58,673 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:15:58,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:15:58,837 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:15:58,838 INFO L272 AbstractInterpreter]: Visited 23 different actions 46 times. Merged at 7 different actions 11 times. Never widened. Performed 411 root evaluator evaluations with a maximum evaluation depth of 3. Performed 411 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-11-23 05:15:58,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:15:58,842 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:15:58,909 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 88.11% of their original sizes. [2018-11-23 05:15:58,909 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:15:59,004 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-23 05:15:59,005 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:15:59,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:15:59,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-11-23 05:15:59,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:15:59,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 05:15:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 05:15:59,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-23 05:15:59,007 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 14 states. [2018-11-23 05:15:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:15:59,844 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 05:15:59,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:15:59,845 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-23 05:15:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:15:59,846 INFO L225 Difference]: With dead ends: 66 [2018-11-23 05:15:59,846 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 05:15:59,847 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:15:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 05:15:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-11-23 05:15:59,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 05:15:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 05:15:59,855 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2018-11-23 05:15:59,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:15:59,855 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 05:15:59,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 05:15:59,855 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 05:15:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 05:15:59,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:15:59,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:15:59,858 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:15:59,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:15:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash 247580725, now seen corresponding path program 1 times [2018-11-23 05:15:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:15:59,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:15:59,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:15:59,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:15:59,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:15:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:15:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:15:59,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:15:59,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:15:59,931 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-23 05:15:59,932 INFO L202 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [63], [64], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-11-23 05:15:59,933 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:15:59,933 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:15:59,980 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 05:15:59,980 INFO L272 AbstractInterpreter]: Visited 31 different actions 62 times. Merged at 9 different actions 13 times. Never widened. Performed 539 root evaluator evaluations with a maximum evaluation depth of 4. Performed 539 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 27 variables. [2018-11-23 05:15:59,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:15:59,999 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 05:16:00,042 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2018-11-23 05:16:00,042 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 05:16:00,271 INFO L415 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-11-23 05:16:00,271 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 05:16:00,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:16:00,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-23 05:16:00,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:16:00,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 05:16:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 05:16:00,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-11-23 05:16:00,272 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 20 states. [2018-11-23 05:16:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:01,251 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-11-23 05:16:01,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 05:16:01,251 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-11-23 05:16:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:01,255 INFO L225 Difference]: With dead ends: 87 [2018-11-23 05:16:01,255 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 05:16:01,255 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2018-11-23 05:16:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 05:16:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-11-23 05:16:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 05:16:01,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-11-23 05:16:01,267 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 42 [2018-11-23 05:16:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:01,267 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-11-23 05:16:01,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 05:16:01,267 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-11-23 05:16:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 05:16:01,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:01,269 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 05:16:01,269 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:01,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:01,269 INFO L82 PathProgramCache]: Analyzing trace with hash -504880584, now seen corresponding path program 1 times [2018-11-23 05:16:01,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:16:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:01,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:01,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:01,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:16:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:01,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:16:01,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:01,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:16:01,332 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-11-23 05:16:01,332 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [63], [64], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-11-23 05:16:01,333 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:16:01,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:16:01,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:16:01,383 INFO L272 AbstractInterpreter]: Visited 43 different actions 88 times. Merged at 11 different actions 18 times. Never widened. Performed 693 root evaluator evaluations with a maximum evaluation depth of 4. Performed 693 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 4 different actions. Largest state had 27 variables. [2018-11-23 05:16:01,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:01,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:16:01,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:01,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:01,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:01,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:16:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:01,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:16:01,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:16:01,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:16:01,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-11-23 05:16:01,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:16:01,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:16:01,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:16:01,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:16:01,602 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 6 states. [2018-11-23 05:16:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:01,650 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2018-11-23 05:16:01,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:16:01,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-11-23 05:16:01,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:01,651 INFO L225 Difference]: With dead ends: 103 [2018-11-23 05:16:01,651 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 05:16:01,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:16:01,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 05:16:01,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-11-23 05:16:01,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 05:16:01,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-11-23 05:16:01,661 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 51 [2018-11-23 05:16:01,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:01,661 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-11-23 05:16:01,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:16:01,661 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 05:16:01,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 05:16:01,663 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:01,663 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:01,664 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:01,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:01,664 INFO L82 PathProgramCache]: Analyzing trace with hash 233296567, now seen corresponding path program 2 times [2018-11-23 05:16:01,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:16:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:01,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:01,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:01,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:16:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:02,473 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:16:02,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:02,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:16:02,473 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:16:02,473 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:16:02,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:02,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:02,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:16:02,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:16:02,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 05:16:02,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:16:02,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:02,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-11-23 05:16:02,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 05:16:02,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:02,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:02,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 05:16:02,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 05:16:02,602 INFO L478 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 11 treesize of output 8 [2018-11-23 05:16:02,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:02,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 05:16:02,719 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 05:16:02,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:02,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-11-23 05:16:02,765 INFO L478 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 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-23 05:16:02,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:02,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 05:16:02,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:02,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2018-11-23 05:16:03,308 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int) (sll_update_at_~data Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) sll_update_at_~head.offset sll_update_at_~data))) |c_#memory_int|)) is different from true [2018-11-23 05:16:03,313 INFO L478 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 34 treesize of output 28 [2018-11-23 05:16:03,315 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:16:03,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-23 05:16:03,316 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:03,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:03,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-23 05:16:03,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:03,330 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:03,334 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:03,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:03,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:18 [2018-11-23 05:16:03,454 INFO L478 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 22 treesize of output 16 [2018-11-23 05:16:03,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-11-23 05:16:03,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:03,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:03,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:03,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-23 05:16:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 05:16:03,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:03,910 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 05:16:03,916 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:16:04,058 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:16:04,064 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:16:04,630 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-23 05:16:04,635 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:16:04,642 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:16:05,382 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:16:09,084 WARN L180 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 67 [2018-11-23 05:16:09,147 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-11-23 05:16:09,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 8 [2018-11-23 05:16:09,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,191 INFO L478 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 23 treesize of output 21 [2018-11-23 05:16:09,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 05:16:09,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,199 INFO L478 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 12 [2018-11-23 05:16:09,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 05:16:09,202 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,204 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:16:09,263 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,267 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,268 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,271 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,272 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,277 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,306 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-11-23 05:16:09,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 8 [2018-11-23 05:16:09,326 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,345 INFO L478 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 23 treesize of output 21 [2018-11-23 05:16:09,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 05:16:09,348 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,352 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,354 INFO L478 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 12 [2018-11-23 05:16:09,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 05:16:09,357 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,358 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,372 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 05:16:09,406 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,409 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,410 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,413 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,414 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,418 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 05:16:09,439 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 8 variables, input treesize:121, output treesize:65 [2018-11-23 05:16:09,598 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-11-23 05:16:09,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 8 [2018-11-23 05:16:09,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,638 INFO L478 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 18 treesize of output 22 [2018-11-23 05:16:09,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-23 05:16:09,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 05:16:09,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-23 05:16:09,653 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2018-11-23 05:16:09,663 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 05:16:09,670 INFO L478 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 23 treesize of output 21 [2018-11-23 05:16:09,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 05:16:09,673 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,677 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 05:16:09,772 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,776 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,777 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,782 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,783 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,787 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,787 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,791 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,792 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,795 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,796 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,801 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,802 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,807 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,870 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,875 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:09,932 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-11-23 05:16:09,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 8 [2018-11-23 05:16:09,948 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,966 INFO L478 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 18 treesize of output 22 [2018-11-23 05:16:09,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-11-23 05:16:09,973 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-23 05:16:09,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2018-11-23 05:16:09,982 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-11-23 05:16:09,989 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:09,993 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 05:16:09,995 INFO L478 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 31 treesize of output 29 [2018-11-23 05:16:09,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 05:16:09,997 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:10,000 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:10,014 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-11-23 05:16:10,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 11 xjuncts. [2018-11-23 05:16:10,094 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 8 variables, input treesize:149, output treesize:300 [2018-11-23 05:16:10,094 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-11-23 05:16:10,580 INFO L478 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 18 treesize of output 16 [2018-11-23 05:16:10,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 [2018-11-23 05:16:10,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 4 [2018-11-23 05:16:10,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:10,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:10,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:10,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:10,591 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2018-11-23 05:16:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:16:10,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:16:10,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29, 29] total 70 [2018-11-23 05:16:10,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:16:10,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 05:16:10,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 05:16:10,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=4484, Unknown=6, NotChecked=134, Total=4830 [2018-11-23 05:16:10,956 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 46 states. [2018-11-23 05:16:14,190 WARN L180 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-11-23 05:16:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:16,590 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-11-23 05:16:16,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 05:16:16,592 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 60 [2018-11-23 05:16:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:16,593 INFO L225 Difference]: With dead ends: 128 [2018-11-23 05:16:16,593 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 05:16:16,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 12 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1975 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=628, Invalid=9870, Unknown=12, NotChecked=202, Total=10712 [2018-11-23 05:16:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 05:16:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 79. [2018-11-23 05:16:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 05:16:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-11-23 05:16:16,619 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 60 [2018-11-23 05:16:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:16,620 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-11-23 05:16:16,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 05:16:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-23 05:16:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 05:16:16,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:16,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:16,623 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:16,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:16,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1057037848, now seen corresponding path program 1 times [2018-11-23 05:16:16,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:16:16,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:16,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:16:16,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:16,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:16:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:16:16,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:16,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:16:16,732 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-11-23 05:16:16,733 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [63], [64], [79], [85], [87], [89], [91], [95], [96], [100], [107], [109], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-11-23 05:16:16,734 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:16:16,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:16:16,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:16:16,812 INFO L272 AbstractInterpreter]: Visited 44 different actions 124 times. Merged at 15 different actions 37 times. Widened at 1 different actions 1 times. Performed 1008 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1008 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 6 different actions. Largest state had 27 variables. [2018-11-23 05:16:16,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:16,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:16:16,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:16,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:16,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:16,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:16:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:16,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:16:16,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:16:17,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:16:17,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-11-23 05:16:17,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:16:17,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:16:17,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:16:17,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:16:17,026 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 5 states. [2018-11-23 05:16:17,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:17,059 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2018-11-23 05:16:17,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:16:17,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-23 05:16:17,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:17,061 INFO L225 Difference]: With dead ends: 104 [2018-11-23 05:16:17,061 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 05:16:17,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:16:17,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 05:16:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-11-23 05:16:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 05:16:17,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2018-11-23 05:16:17,075 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 61 [2018-11-23 05:16:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:17,076 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2018-11-23 05:16:17,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:16:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2018-11-23 05:16:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 05:16:17,077 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:17,077 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:17,077 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:17,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:17,077 INFO L82 PathProgramCache]: Analyzing trace with hash 754820928, now seen corresponding path program 3 times [2018-11-23 05:16:17,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:16:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:17,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:17,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:17,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:16:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 05:16:17,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:17,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:16:17,132 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:16:17,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:16:17,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:17,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:17,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:16:17,151 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 05:16:17,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:16:17,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:16:17,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:17,210 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:16:17,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:17,263 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:16:17,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:16:17,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-11-23 05:16:17,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:16:17,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:16:17,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:16:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:16:17,283 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 8 states. [2018-11-23 05:16:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:17,349 INFO L93 Difference]: Finished difference Result 142 states and 170 transitions. [2018-11-23 05:16:17,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:16:17,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-11-23 05:16:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:17,350 INFO L225 Difference]: With dead ends: 142 [2018-11-23 05:16:17,350 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 05:16:17,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:16:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 05:16:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-11-23 05:16:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 05:16:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2018-11-23 05:16:17,365 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 61 [2018-11-23 05:16:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:17,365 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2018-11-23 05:16:17,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:16:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2018-11-23 05:16:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 05:16:17,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:17,366 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:17,366 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:17,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash 267456236, now seen corresponding path program 4 times [2018-11-23 05:16:17,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:16:17,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:17,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:16:17,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:17,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:16:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 05:16:17,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:17,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:16:17,411 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:16:17,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:16:17,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:17,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:17,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:17,419 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:16:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:17,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:17,492 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 05:16:17,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 05:16:17,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:16:17,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 05:16:17,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:16:17,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:16:17,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:16:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:16:17,584 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 8 states. [2018-11-23 05:16:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:17,678 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-11-23 05:16:17,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:16:17,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-11-23 05:16:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:17,683 INFO L225 Difference]: With dead ends: 124 [2018-11-23 05:16:17,683 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 05:16:17,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:16:17,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 05:16:17,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-11-23 05:16:17,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 05:16:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-11-23 05:16:17,700 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 61 [2018-11-23 05:16:17,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:17,700 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-11-23 05:16:17,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:16:17,700 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-11-23 05:16:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 05:16:17,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:17,701 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:17,702 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:17,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:17,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1526562495, now seen corresponding path program 5 times [2018-11-23 05:16:17,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:16:17,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:17,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:17,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:17,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:16:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 05:16:17,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:17,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:16:17,750 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:16:17,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:16:17,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:17,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:17,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:16:17,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:16:17,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 05:16:17,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:16:17,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 05:16:17,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 05:16:17,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:16:17,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 10 [2018-11-23 05:16:17,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:16:17,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:16:17,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:16:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 05:16:17,883 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 7 states. [2018-11-23 05:16:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:17,941 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2018-11-23 05:16:17,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 05:16:17,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-11-23 05:16:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:17,943 INFO L225 Difference]: With dead ends: 119 [2018-11-23 05:16:17,943 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 05:16:17,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:16:17,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 05:16:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-11-23 05:16:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 05:16:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-11-23 05:16:17,960 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 68 [2018-11-23 05:16:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:17,960 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-23 05:16:17,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:16:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-11-23 05:16:17,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 05:16:17,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:17,961 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:17,961 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:17,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:17,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2033764854, now seen corresponding path program 6 times [2018-11-23 05:16:17,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:16:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:17,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:16:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:17,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:16:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 05:16:18,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:18,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:16:18,027 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:16:18,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:16:18,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:18,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:18,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 05:16:18,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 05:16:18,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 05:16:18,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:16:18,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:18,148 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 05:16:18,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:18,179 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 05:16:18,197 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:16:18,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-11-23 05:16:18,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:16:18,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:16:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:16:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:16:18,198 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 6 states. [2018-11-23 05:16:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:18,228 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-11-23 05:16:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:16:18,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-23 05:16:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:18,230 INFO L225 Difference]: With dead ends: 121 [2018-11-23 05:16:18,230 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 05:16:18,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:16:18,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 05:16:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 05:16:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 05:16:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-23 05:16:18,241 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 69 [2018-11-23 05:16:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:18,241 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-23 05:16:18,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:16:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-23 05:16:18,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 05:16:18,242 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:18,242 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:18,242 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:18,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash 247983362, now seen corresponding path program 1 times [2018-11-23 05:16:18,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:16:18,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:18,243 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:16:18,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:18,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:16:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:16:18,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:18,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:16:18,284 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-11-23 05:16:18,285 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [63], [64], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-11-23 05:16:18,286 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:16:18,286 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:16:18,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:16:18,348 INFO L272 AbstractInterpreter]: Visited 45 different actions 145 times. Merged at 23 different actions 44 times. Never widened. Performed 1191 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1191 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 6 different actions. Largest state had 27 variables. [2018-11-23 05:16:18,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:18,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:16:18,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:18,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:18,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:16:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:18,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:16:18,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:18,444 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:16:18,460 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:16:18,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-11-23 05:16:18,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:16:18,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 05:16:18,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 05:16:18,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 05:16:18,461 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2018-11-23 05:16:18,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:18,507 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-23 05:16:18,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 05:16:18,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-11-23 05:16:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:18,508 INFO L225 Difference]: With dead ends: 69 [2018-11-23 05:16:18,508 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 05:16:18,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:16:18,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 05:16:18,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 05:16:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 05:16:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-11-23 05:16:18,517 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 70 [2018-11-23 05:16:18,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:18,518 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-11-23 05:16:18,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 05:16:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-11-23 05:16:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 05:16:18,518 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:18,518 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:18,519 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:18,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1512328493, now seen corresponding path program 1 times [2018-11-23 05:16:18,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:16:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:18,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:16:18,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:16:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 05:16:19,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:19,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:16:19,242 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-11-23 05:16:19,243 INFO L202 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [63], [64], [79], [85], [87], [89], [91], [95], [96], [100], [107], [109], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-11-23 05:16:19,244 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:16:19,244 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:16:19,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:16:19,326 INFO L272 AbstractInterpreter]: Visited 46 different actions 190 times. Merged at 27 different actions 76 times. Widened at 2 different actions 2 times. Performed 1378 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1378 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 8 different actions. Largest state had 27 variables. [2018-11-23 05:16:19,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:19,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:16:19,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:19,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:19,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:19,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:16:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:19,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:19,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-11-23 05:16:19,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:19,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:19,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 05:16:19,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:19,523 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:19,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 05:16:19,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:19,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:19,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 05:16:19,553 INFO L478 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 11 treesize of output 8 [2018-11-23 05:16:19,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:19,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:19,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:19,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:19,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 05:16:19,736 INFO L478 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 05:16:19,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-11-23 05:16:19,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:19,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:19,742 INFO L267 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. [2018-11-23 05:16:19,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2018-11-23 05:16:20,962 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-11-23 05:16:20,966 INFO L478 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 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 05:16:20,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:20,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 05:16:20,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:20,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:20,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:20,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-11-23 05:16:21,105 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 05:16:21,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2018-11-23 05:16:21,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-11-23 05:16:21,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:21,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 113 [2018-11-23 05:16:21,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 1 [2018-11-23 05:16:21,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:21,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-11-23 05:16:21,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 1 [2018-11-23 05:16:21,191 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,200 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:126, output treesize:36 [2018-11-23 05:16:21,686 INFO L478 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 62 treesize of output 60 [2018-11-23 05:16:21,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 56 treesize of output 50 [2018-11-23 05:16:21,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:21,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 52 treesize of output 42 [2018-11-23 05:16:21,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:21,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 50 treesize of output 46 [2018-11-23 05:16:21,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:21,749 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 05:16:21,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-23 05:16:21,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-23 05:16:21,771 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:21,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 05:16:21,781 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:21,788 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:21,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2018-11-23 05:16:21,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-23 05:16:21,802 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:21,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 05:16:21,817 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:21,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2018-11-23 05:16:21,833 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:21,847 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 05:16:21,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-11-23 05:16:21,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-23 05:16:21,882 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-23 05:16:21,901 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,914 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 34 treesize of output 28 [2018-11-23 05:16:21,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-23 05:16:21,918 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,923 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 23 treesize of output 19 [2018-11-23 05:16:21,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 05:16:21,927 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,931 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:21,945 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 5 variables, input treesize:65, output treesize:7 [2018-11-23 05:16:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-11-23 05:16:22,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:22,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,515 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,516 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,525 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,532 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,674 INFO L478 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 109 treesize of output 75 [2018-11-23 05:16:22,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 5 [2018-11-23 05:16:22,677 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:22,688 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:22,692 INFO L478 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 135 treesize of output 101 [2018-11-23 05:16:22,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 05:16:22,697 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:22,704 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:22,706 INFO L478 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 99 treesize of output 65 [2018-11-23 05:16:22,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 05:16:22,709 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:22,713 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:22,791 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,799 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,800 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,808 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,809 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,820 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,886 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,891 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,892 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,898 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,898 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,903 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:22,968 INFO L478 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 115 treesize of output 81 [2018-11-23 05:16:22,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 5 [2018-11-23 05:16:22,970 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:22,971 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:22,973 INFO L478 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 115 treesize of output 81 [2018-11-23 05:16:22,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-11-23 05:16:22,976 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:22,978 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:23,019 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:23,021 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:23,022 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:23,024 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:23,025 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:23,026 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:23,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-23 05:16:23,050 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 6 variables, input treesize:281, output treesize:260 [2018-11-23 05:16:23,295 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 05:16:23,589 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:23,589 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) 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:123) 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) [2018-11-23 05:16:23,592 INFO L168 Benchmark]: Toolchain (without parser) took 26014.04 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 457.7 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -223.0 MB). Peak memory consumption was 234.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:16:23,592 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:16:23,592 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -203.7 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:16:23,592 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:16:23,592 INFO L168 Benchmark]: Boogie Preprocessor took 20.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:16:23,593 INFO L168 Benchmark]: RCFGBuilder took 236.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-23 05:16:23,593 INFO L168 Benchmark]: TraceAbstraction took 25376.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.0 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:16:23,594 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 955.4 MB in the beginning and 1.2 GB in the end (delta: -203.7 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25376.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -56.0 MB). Peak memory consumption was 233.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 05:16:25,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:16:25,084 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:16:25,093 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:16:25,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:16:25,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:16:25,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:16:25,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:16:25,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:16:25,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:16:25,098 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:16:25,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:16:25,099 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:16:25,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:16:25,101 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:16:25,101 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:16:25,102 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:16:25,103 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:16:25,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:16:25,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:16:25,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:16:25,107 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:16:25,109 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:16:25,109 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:16:25,109 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:16:25,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:16:25,111 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:16:25,112 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:16:25,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:16:25,114 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:16:25,114 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:16:25,114 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:16:25,114 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:16:25,115 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:16:25,115 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:16:25,116 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:16:25,116 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 05:16:25,127 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:16:25,127 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:16:25,128 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:16:25,128 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:16:25,128 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:16:25,128 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:16:25,128 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:16:25,128 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:16:25,128 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:16:25,128 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:16:25,129 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:16:25,129 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:16:25,129 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:16:25,129 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:16:25,129 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:16:25,129 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:16:25,129 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:16:25,130 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 05:16:25,131 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 05:16:25,131 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:16:25,131 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:16:25,131 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:16:25,131 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:16:25,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:16:25,132 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 05:16:25,132 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 05:16:25,133 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/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 -> b18fe0627204ab4c483aeb119f16f48fd5019cde [2018-11-23 05:16:25,161 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:16:25,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:16:25,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:16:25,173 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:16:25,173 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:16:25,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:16:25,210 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data/b017d044e/366d2d0ee6b54aef835b098b5793350f/FLAG0c5a1e797 [2018-11-23 05:16:25,642 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:16:25,643 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:16:25,650 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data/b017d044e/366d2d0ee6b54aef835b098b5793350f/FLAG0c5a1e797 [2018-11-23 05:16:25,658 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/data/b017d044e/366d2d0ee6b54aef835b098b5793350f [2018-11-23 05:16:25,660 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:16:25,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:16:25,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:16:25,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:16:25,665 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:16:25,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:16:25" (1/1) ... [2018-11-23 05:16:25,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3358de21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:25, skipping insertion in model container [2018-11-23 05:16:25,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:16:25" (1/1) ... [2018-11-23 05:16:25,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:16:25,708 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:16:25,943 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:16:25,951 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:16:25,986 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:16:26,068 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:16:26,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26 WrapperNode [2018-11-23 05:16:26,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:16:26,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:16:26,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:16:26,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:16:26,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... [2018-11-23 05:16:26,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... [2018-11-23 05:16:26,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:16:26,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:16:26,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:16:26,090 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:16:26,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... [2018-11-23 05:16:26,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... [2018-11-23 05:16:26,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... [2018-11-23 05:16:26,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... [2018-11-23 05:16:26,107 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... [2018-11-23 05:16:26,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... [2018-11-23 05:16:26,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... [2018-11-23 05:16:26,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:16:26,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:16:26,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:16:26,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:16:26,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/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 [2018-11-23 05:16:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-23 05:16:26,148 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-23 05:16:26,148 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 05:16:26,149 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 05:16:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:16:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 05:16:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-23 05:16:26,149 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-23 05:16:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 05:16:26,149 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 05:16:26,149 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 05:16:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 05:16:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 05:16:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 05:16:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:16:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:16:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:16:26,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:16:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 05:16:26,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 05:16:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:16:26,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 05:16:26,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:16:26,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:16:26,410 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:16:26,411 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 05:16:26,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:16:26 BoogieIcfgContainer [2018-11-23 05:16:26,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:16:26,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:16:26,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:16:26,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:16:26,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:16:25" (1/3) ... [2018-11-23 05:16:26,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37799032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:16:26, skipping insertion in model container [2018-11-23 05:16:26,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:16:26" (2/3) ... [2018-11-23 05:16:26,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37799032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:16:26, skipping insertion in model container [2018-11-23 05:16:26,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:16:26" (3/3) ... [2018-11-23 05:16:26,418 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 05:16:26,426 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:16:26,431 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:16:26,440 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:16:26,460 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 05:16:26,461 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:16:26,461 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:16:26,461 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:16:26,461 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:16:26,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:16:26,461 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:16:26,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:16:26,462 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:16:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-23 05:16:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 05:16:26,476 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:26,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:26,478 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:26,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:26,481 INFO L82 PathProgramCache]: Analyzing trace with hash 197480979, now seen corresponding path program 1 times [2018-11-23 05:16:26,484 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:16:26,484 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:16:26,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:26,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:16:26,597 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:16:26,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:16:26,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:16:26,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:16:26,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:16:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:16:26,619 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-11-23 05:16:26,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:26,690 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-23 05:16:26,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:16:26,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 05:16:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:26,698 INFO L225 Difference]: With dead ends: 95 [2018-11-23 05:16:26,698 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 05:16:26,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 05:16:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 05:16:26,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 05:16:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 05:16:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 05:16:26,731 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 24 [2018-11-23 05:16:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:26,731 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 05:16:26,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:16:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 05:16:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 05:16:26,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:26,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:26,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:26,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:26,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2132511215, now seen corresponding path program 1 times [2018-11-23 05:16:26,733 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:16:26,733 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:16:26,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:26,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:16:26,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:16:27,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:27,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:27,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:27,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:27,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:16:27,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:16:27,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:16:27,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-11-23 05:16:27,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 05:16:27,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 05:16:27,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-11-23 05:16:27,438 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 16 states. [2018-11-23 05:16:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:27,588 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 05:16:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:16:27,589 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-11-23 05:16:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:27,590 INFO L225 Difference]: With dead ends: 73 [2018-11-23 05:16:27,590 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 05:16:27,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:16:27,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 05:16:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 05:16:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 05:16:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-23 05:16:27,597 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 33 [2018-11-23 05:16:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:27,597 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-23 05:16:27,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 05:16:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 05:16:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 05:16:27,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:27,599 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 05:16:27,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:27,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:27,599 INFO L82 PathProgramCache]: Analyzing trace with hash -906301485, now seen corresponding path program 2 times [2018-11-23 05:16:27,600 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:16:27,600 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:16:27,612 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:16:27,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 05:16:27,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:16:27,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 05:16:27,680 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 05:16:27,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:16:27,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 05:16:27,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 05:16:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 05:16:27,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:16:27,682 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 4 states. [2018-11-23 05:16:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:27,715 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-23 05:16:27,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 05:16:27,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 05:16:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:27,716 INFO L225 Difference]: With dead ends: 67 [2018-11-23 05:16:27,716 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 05:16:27,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 05:16:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 05:16:27,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-23 05:16:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 05:16:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-23 05:16:27,724 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2018-11-23 05:16:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:27,724 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-23 05:16:27,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 05:16:27,724 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 05:16:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 05:16:27,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:27,726 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 05:16:27,726 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:27,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:27,726 INFO L82 PathProgramCache]: Analyzing trace with hash -743230615, now seen corresponding path program 1 times [2018-11-23 05:16:27,726 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:16:27,726 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:16:27,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:16:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:27,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 05:16:27,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 05:16:27,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:27,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:27,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:27,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:28,003 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 05:16:28,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:28,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-23 05:16:28,199 INFO L478 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 31 treesize of output 31 [2018-11-23 05:16:28,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 05:16:28,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-23 05:16:28,240 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-11-23 05:16:28,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,279 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:31, output treesize:7 [2018-11-23 05:16:28,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 05:16:28,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:28,616 INFO L478 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 5 [2018-11-23 05:16:28,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2018-11-23 05:16:28,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:28,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 05:16:28,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-11-23 05:16:28,680 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 05:16:28,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:16:28,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14, 12] total 26 [2018-11-23 05:16:28,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 05:16:28,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 05:16:28,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-11-23 05:16:28,696 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 26 states. [2018-11-23 05:16:31,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:31,664 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-11-23 05:16:31,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 05:16:31,664 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-11-23 05:16:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:31,667 INFO L225 Difference]: With dead ends: 92 [2018-11-23 05:16:31,667 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 05:16:31,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 05:16:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 05:16:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2018-11-23 05:16:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 05:16:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-23 05:16:31,673 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 50 [2018-11-23 05:16:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:31,674 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-23 05:16:31,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 05:16:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 05:16:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 05:16:31,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:31,675 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:31,675 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:31,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:31,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1855029503, now seen corresponding path program 2 times [2018-11-23 05:16:31,675 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:16:31,675 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:16:31,687 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:16:31,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:16:31,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:16:31,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:31,809 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:16:31,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:16:31,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:31,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:31,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:16:31,903 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:16:31,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:16:31,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:16:31,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:16:31,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:16:31,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-11-23 05:16:31,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:16:31,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:16:31,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:16:31,971 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-11-23 05:16:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:16:32,098 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2018-11-23 05:16:32,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:16:32,098 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-23 05:16:32,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:16:32,099 INFO L225 Difference]: With dead ends: 95 [2018-11-23 05:16:32,099 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 05:16:32,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:16:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 05:16:32,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-11-23 05:16:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 05:16:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-11-23 05:16:32,110 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 58 [2018-11-23 05:16:32,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:16:32,110 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-23 05:16:32,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:16:32,110 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-23 05:16:32,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 05:16:32,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:16:32,111 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:16:32,112 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:16:32,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:16:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2081241532, now seen corresponding path program 1 times [2018-11-23 05:16:32,112 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:16:32,112 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:16:32,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:16:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:32,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:32,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-11-23 05:16:32,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 05:16:32,331 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:32,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:32,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 05:16:32,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 05:16:32,356 INFO L478 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 11 treesize of output 8 [2018-11-23 05:16:32,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:32,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 05:16:32,539 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 05:16:32,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:32,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 05:16:32,608 INFO L478 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 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 05:16:32,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:32,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 05:16:32,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:32,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-11-23 05:16:34,314 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (bvadd |c_sll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) sll_update_at_~head.offset sll_update_at_~data))) |c_#memory_int|)) is different from true [2018-11-23 05:16:34,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:34,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-23 05:16:34,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 13 [2018-11-23 05:16:34,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:34,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:34,353 INFO L478 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 22 treesize of output 18 [2018-11-23 05:16:34,355 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:16:34,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 05:16:34,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:34,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:34,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:34,372 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:16 [2018-11-23 05:16:36,668 INFO L478 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 31 treesize of output 31 [2018-11-23 05:16:36,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-11-23 05:16:36,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:36,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-23 05:16:36,686 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:36,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:36,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:36,696 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-23 05:16:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 05:16:36,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:39,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:16:39,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:16:39,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:16:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:16:39,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:16:39,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-11-23 05:16:39,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 05:16:39,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:39,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:39,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 05:16:39,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 05:16:39,436 INFO L478 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 11 treesize of output 8 [2018-11-23 05:16:39,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:39,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,445 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 05:16:39,460 INFO L478 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 05:16:39,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:39,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 05:16:39,481 INFO L478 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 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 05:16:39,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:16:39,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 05:16:39,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-11-23 05:16:39,515 INFO L478 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 26 [2018-11-23 05:16:39,519 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 05:16:39,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-23 05:16:39,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:39,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:16:39,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 05:16:39,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:16:39,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:39,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:16 [2018-11-23 05:16:41,668 INFO L478 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 31 treesize of output 31 [2018-11-23 05:16:41,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2018-11-23 05:16:41,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:16:41,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:41,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:16:41,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-11-23 05:16:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 05:16:41,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:16:44,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:16:44,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 05:16:44,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 05:16:44,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 05:16:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1232, Unknown=3, NotChecked=70, Total=1406 [2018-11-23 05:16:44,045 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 31 states. [2018-11-23 05:17:13,151 WARN L180 SmtUtils]: Spent 1.99 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 05:17:27,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:27,484 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-11-23 05:17:27,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 05:17:27,484 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-11-23 05:17:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:17:27,485 INFO L225 Difference]: With dead ends: 98 [2018-11-23 05:17:27,485 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 05:17:27,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=273, Invalid=3137, Unknown=16, NotChecked=114, Total=3540 [2018-11-23 05:17:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 05:17:27,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-11-23 05:17:27,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 05:17:27,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2018-11-23 05:17:27,501 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 59 [2018-11-23 05:17:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:17:27,501 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2018-11-23 05:17:27,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 05:17:27,501 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2018-11-23 05:17:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 05:17:27,503 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:17:27,503 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:27,504 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:17:27,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:27,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1507935656, now seen corresponding path program 1 times [2018-11-23 05:17:27,504 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:17:27,504 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:17:27,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:27,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:17:27,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 05:17:27,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 05:17:27,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-11-23 05:17:27,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 05:17:27,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 05:17:27,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:17:27,704 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 7 states. [2018-11-23 05:17:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:27,778 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2018-11-23 05:17:27,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:17:27,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-11-23 05:17:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:17:27,779 INFO L225 Difference]: With dead ends: 118 [2018-11-23 05:17:27,780 INFO L226 Difference]: Without dead ends: 94 [2018-11-23 05:17:27,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 05:17:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-23 05:17:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-11-23 05:17:27,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 05:17:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2018-11-23 05:17:27,796 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 60 [2018-11-23 05:17:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:17:27,797 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2018-11-23 05:17:27,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 05:17:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2018-11-23 05:17:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 05:17:27,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:17:27,799 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:27,799 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:17:27,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash 448407967, now seen corresponding path program 2 times [2018-11-23 05:17:27,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:17:27,799 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:17:27,825 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:17:27,908 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:17:27,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:17:27,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:27,967 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:17:27,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:17:28,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:28,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:17:28,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:17:28,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:17:28,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:17:28,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:28,215 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:17:28,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:28,562 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 05:17:28,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:17:28,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-11-23 05:17:28,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 05:17:28,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 05:17:28,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:17:28,579 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand 18 states. [2018-11-23 05:17:29,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:29,613 INFO L93 Difference]: Finished difference Result 168 states and 214 transitions. [2018-11-23 05:17:29,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 05:17:29,614 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-11-23 05:17:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:17:29,615 INFO L225 Difference]: With dead ends: 168 [2018-11-23 05:17:29,615 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 05:17:29,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-11-23 05:17:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 05:17:29,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-11-23 05:17:29,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 05:17:29,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2018-11-23 05:17:29,634 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 60 [2018-11-23 05:17:29,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:17:29,634 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2018-11-23 05:17:29,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 05:17:29,634 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2018-11-23 05:17:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 05:17:29,635 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:17:29,635 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:29,635 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:17:29,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:29,635 INFO L82 PathProgramCache]: Analyzing trace with hash 955300047, now seen corresponding path program 1 times [2018-11-23 05:17:29,635 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:17:29,635 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:17:29,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:29,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:17:29,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:17:29,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:29,829 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:17:29,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:29,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:29,881 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:17:29,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:17:29,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:17:29,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-11-23 05:17:29,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 05:17:29,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 05:17:29,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 05:17:29,949 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand 9 states. [2018-11-23 05:17:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:30,107 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2018-11-23 05:17:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:17:30,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-11-23 05:17:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:17:30,109 INFO L225 Difference]: With dead ends: 145 [2018-11-23 05:17:30,109 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 05:17:30,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 05:17:30,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 05:17:30,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2018-11-23 05:17:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 05:17:30,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2018-11-23 05:17:30,128 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 68 [2018-11-23 05:17:30,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:17:30,128 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2018-11-23 05:17:30,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 05:17:30,128 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2018-11-23 05:17:30,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 05:17:30,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:17:30,129 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:30,129 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:17:30,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:30,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2014627383, now seen corresponding path program 3 times [2018-11-23 05:17:30,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:17:30,130 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:17:30,144 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 05:17:30,377 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 05:17:30,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:17:30,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 05:17:30,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:30,541 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 05:17:30,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:30,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:17:30,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:17:32,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 05:17:32,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:17:32,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 05:17:32,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 05:17:32,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:17:32,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8, 12] total 18 [2018-11-23 05:17:32,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 05:17:32,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 05:17:32,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:17:32,350 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand 18 states. [2018-11-23 05:17:32,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:32,475 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2018-11-23 05:17:32,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:17:32,476 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2018-11-23 05:17:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:17:32,476 INFO L225 Difference]: With dead ends: 134 [2018-11-23 05:17:32,476 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 05:17:32,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 249 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-23 05:17:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 05:17:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-23 05:17:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 05:17:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-11-23 05:17:32,484 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 68 [2018-11-23 05:17:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:17:32,484 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-11-23 05:17:32,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 05:17:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-11-23 05:17:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 05:17:32,484 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:17:32,485 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:32,485 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:17:32,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:32,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1151444093, now seen corresponding path program 1 times [2018-11-23 05:17:32,485 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:17:32,485 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:17:32,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:17:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:32,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:32,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-11-23 05:17:32,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:32,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:32,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 05:17:32,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:32,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:32,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 05:17:32,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:32,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:32,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 05:17:32,782 INFO L478 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 11 treesize of output 8 [2018-11-23 05:17:32,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:17:32,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:32,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:32,800 INFO L478 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 11 treesize of output 8 [2018-11-23 05:17:32,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:17:32,803 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:32,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:32,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:32,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-11-23 05:17:33,054 INFO L478 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 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 05:17:33,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:33,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 05:17:33,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,091 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 05:17:33,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:33,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 12 [2018-11-23 05:17:33,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,108 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:57, output treesize:27 [2018-11-23 05:17:33,322 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 05:17:33,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2018-11-23 05:17:33,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,358 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-11-23 05:17:33,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:33,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 126 [2018-11-23 05:17:33,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 1 [2018-11-23 05:17:33,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 77 [2018-11-23 05:17:33,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 1 [2018-11-23 05:17:33,581 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:33,597 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:49 [2018-11-23 05:17:34,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2018-11-23 05:17:34,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 29 [2018-11-23 05:17:34,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 18 [2018-11-23 05:17:34,506 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2018-11-23 05:17:34,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,546 INFO L478 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 15 treesize of output 19 [2018-11-23 05:17:34,548 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,571 INFO L478 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 17 treesize of output 21 [2018-11-23 05:17:34,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 15 [2018-11-23 05:17:34,575 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2018-11-23 05:17:34,591 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2018-11-23 05:17:34,601 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,602 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:34,607 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:85, output treesize:11 [2018-11-23 05:17:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 05:17:34,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:35,728 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 05:17:35,967 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 05:17:36,108 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 05:17:36,206 INFO L478 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 21 treesize of output 13 [2018-11-23 05:17:36,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 5 [2018-11-23 05:17:36,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:36,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:36,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,277 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,278 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,282 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,317 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:36,321 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:36,321 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,325 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,325 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,328 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:17:36,350 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:140, output treesize:88 [2018-11-23 05:17:36,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:36,516 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:17:36,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:17:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:17:36,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:36,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2018-11-23 05:17:36,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 05:17:36,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:36,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:36,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 05:17:36,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 05:17:36,876 INFO L478 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 11 treesize of output 8 [2018-11-23 05:17:36,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2018-11-23 05:17:36,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:36,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 05:17:37,340 INFO L478 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 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 05:17:37,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2018-11-23 05:17:37,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:37,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:37,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:37,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-11-23 05:17:37,456 INFO L478 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 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 05:17:37,458 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:37,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 05:17:37,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:37,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:37,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:37,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-11-23 05:17:37,940 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 20 [2018-11-23 05:17:37,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 20 treesize of output 19 [2018-11-23 05:17:37,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:37,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:37,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:37,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:113 [2018-11-23 05:17:38,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:38,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 115 [2018-11-23 05:17:38,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 1 [2018-11-23 05:17:38,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:38,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:38,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 05:17:38,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-11-23 05:17:38,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 1 [2018-11-23 05:17:38,335 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:38,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:38,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:38,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:139, output treesize:42 [2018-11-23 05:17:40,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2018-11-23 05:17:40,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 27 [2018-11-23 05:17:40,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:40,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 3 [2018-11-23 05:17:40,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:40,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:40,063 INFO L478 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 17 treesize of output 21 [2018-11-23 05:17:40,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 15 [2018-11-23 05:17:40,066 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:40,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 13 treesize of output 9 [2018-11-23 05:17:40,079 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:40,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:40,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:40,084 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:74, output treesize:9 [2018-11-23 05:17:40,095 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 05:17:40,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:41,684 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 05:17:41,947 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 05:17:42,109 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-23 05:17:42,261 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 05:17:42,263 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,295 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,318 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,340 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,341 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,364 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,553 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,579 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,580 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,606 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,606 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,634 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,636 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,656 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 05:17:42,852 INFO L478 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 115 treesize of output 81 [2018-11-23 05:17:42,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 5 [2018-11-23 05:17:42,858 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:42,865 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:42,869 INFO L478 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 115 treesize of output 81 [2018-11-23 05:17:42,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 39 treesize of output 5 [2018-11-23 05:17:42,874 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:42,879 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:42,884 INFO L478 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 79 treesize of output 45 [2018-11-23 05:17:42,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 39 treesize of output 5 [2018-11-23 05:17:42,889 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 05:17:42,891 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 05:17:42,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 05:17:42,934 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:148, output treesize:115 [2018-11-23 05:17:43,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 05:17:43,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 57 [2018-11-23 05:17:43,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 05:17:43,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 05:17:43,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=5049, Unknown=45, NotChecked=0, Total=5402 [2018-11-23 05:17:43,226 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 57 states. [2018-11-23 05:17:49,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:49,298 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-23 05:17:49,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 05:17:49,298 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 69 [2018-11-23 05:17:49,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:17:49,299 INFO L225 Difference]: With dead ends: 73 [2018-11-23 05:17:49,299 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 05:17:49,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=586, Invalid=8295, Unknown=49, NotChecked=0, Total=8930 [2018-11-23 05:17:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 05:17:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 05:17:49,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 05:17:49,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-23 05:17:49,308 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 69 [2018-11-23 05:17:49,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:17:49,308 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-23 05:17:49,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 05:17:49,308 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-23 05:17:49,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 05:17:49,309 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:17:49,309 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:17:49,309 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:17:49,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:17:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1358025073, now seen corresponding path program 2 times [2018-11-23 05:17:49,309 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 05:17:49,309 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 05:17:49,321 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 05:17:49,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:17:49,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:17:49,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:17:49,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:49,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:17:49,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:17:49,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_25aa0d1c-ab81-4317-b0ee-316a7c1460fe/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 05:17:49,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 05:17:49,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 05:17:49,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:17:49,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:17:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:17:49,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:17:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 05:17:50,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 05:17:50,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-11-23 05:17:50,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 05:17:50,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 05:17:50,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 05:17:50,017 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 18 states. [2018-11-23 05:17:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:17:50,461 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-11-23 05:17:50,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 05:17:50,461 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-11-23 05:17:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:17:50,461 INFO L225 Difference]: With dead ends: 70 [2018-11-23 05:17:50,461 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 05:17:50,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-11-23 05:17:50,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 05:17:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 05:17:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 05:17:50,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 05:17:50,463 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-11-23 05:17:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:17:50,463 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 05:17:50,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 05:17:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 05:17:50,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 05:17:50,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 05:17:50,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:17:50,605 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 05:17:50,921 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2018-11-23 05:17:51,035 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2018-11-23 05:17:51,418 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2018-11-23 05:17:51,530 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-11-23 05:17:51,864 WARN L180 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2018-11-23 05:17:52,094 INFO L451 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: true [2018-11-23 05:17:52,094 INFO L448 ceAbstractionStarter]: For program point exitEXIT(lines 560 562) no Hoare annotation was computed. [2018-11-23 05:17:52,094 INFO L451 ceAbstractionStarter]: At program point exitENTRY(lines 560 562) the Hoare annotation is: true [2018-11-23 05:17:52,094 INFO L448 ceAbstractionStarter]: For program point exitFINAL(lines 560 562) no Hoare annotation was computed. [2018-11-23 05:17:52,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:17:52,094 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-11-23 05:17:52,094 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:17:52,094 INFO L448 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-11-23 05:17:52,095 INFO L451 ceAbstractionStarter]: At program point L582-2(lines 582 586) the Hoare annotation is: true [2018-11-23 05:17:52,095 INFO L451 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-11-23 05:17:52,095 INFO L448 ceAbstractionStarter]: For program point L582-3(lines 581 587) no Hoare annotation was computed. [2018-11-23 05:17:52,095 INFO L448 ceAbstractionStarter]: For program point sll_update_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-11-23 05:17:52,095 INFO L444 ceAbstractionStarter]: At program point L596-2(lines 596 599) the Hoare annotation is: (let ((.cse0 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse4 (= sll_update_at_~data |sll_update_at_#in~data|)) (.cse1 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse5 (and (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~head.base |sll_update_at_#in~head.base|) .cse0 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) .cse2 .cse4 .cse1))) (and (or (and .cse0 .cse1 (bvsgt (bvadd |sll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse3 (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (and .cse0 (= (bvadd sll_update_at_~index (_ bv1 32)) |sll_update_at_#in~index|) .cse2 (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) .cse3) sll_update_at_~head.base) .cse4 .cse1 (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse3) sll_update_at_~head.offset))) .cse5 (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32)))))) (or .cse5 (bvsgt |sll_update_at_#in~index| (_ bv0 32)))))) [2018-11-23 05:17:52,095 INFO L448 ceAbstractionStarter]: For program point L596-3(lines 596 599) no Hoare annotation was computed. [2018-11-23 05:17:52,095 INFO L448 ceAbstractionStarter]: For program point sll_update_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-11-23 05:17:52,095 INFO L444 ceAbstractionStarter]: At program point sll_update_atENTRY(lines 595 601) the Hoare annotation is: (let ((.cse0 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (and (or (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32))))) .cse0) (or .cse0 (bvsgt |sll_update_at_#in~index| (_ bv0 32))))) [2018-11-23 05:17:52,095 INFO L444 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse0 (bvsgt sll_create_~len (_ bv0 32)))) (or (and (= (_ bv0 32) sll_create_~head~0.offset) (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (or (and (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt |sll_create_#in~len| (_ bv0 32))) .cse0))) (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) [2018-11-23 05:17:52,095 INFO L448 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-11-23 05:17:52,095 INFO L448 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-11-23 05:17:52,096 INFO L448 ceAbstractionStarter]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2018-11-23 05:17:52,096 INFO L444 ceAbstractionStarter]: At program point L574-3(lines 574 578) the Hoare annotation is: (let ((.cse0 (= (_ bv1 1) (select |#valid| sll_create_~head~0.base))) (.cse1 (= (_ bv0 32) sll_create_~head~0.offset))) (or (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) .cse1 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv4 32)))) (and .cse0 (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) .cse1 (bvsgt |sll_create_#in~len| (_ bv0 32))))) [2018-11-23 05:17:52,096 INFO L448 ceAbstractionStarter]: For program point L574-4(lines 574 578) no Hoare annotation was computed. [2018-11-23 05:17:52,096 INFO L444 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 05:17:52,096 INFO L448 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-11-23 05:17:52,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 05:17:52,096 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 05:17:52,096 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 05:17:52,096 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 05:17:52,096 INFO L444 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: (let ((.cse0 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base))) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 (= main_~i~0 (_ bv0 32)) .cse2 .cse3) (and .cse0 .cse2 .cse1 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (bvadd (bvneg main_~len~0) main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) .cse3 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-23 05:17:52,096 INFO L448 ceAbstractionStarter]: For program point L611-2(lines 611 616) no Hoare annotation was computed. [2018-11-23 05:17:52,096 INFO L448 ceAbstractionStarter]: For program point L609-1(lines 607 610) no Hoare annotation was computed. [2018-11-23 05:17:52,097 INFO L444 ceAbstractionStarter]: At program point L611-3(lines 611 616) the Hoare annotation is: (let ((.cse11 (bvsgt main_~i~0 (_ bv0 32))) (.cse6 (= main_~i~0 (_ bv0 32)))) (let ((.cse8 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse9 (bvneg main_~len~0)) (.cse4 (let ((.cse12 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse11 .cse12) (and .cse12 .cse6)))) (.cse5 (= main_~s~0.offset (_ bv0 32))) (.cse7 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))) (let ((.cse0 (and .cse11 (and .cse4 .cse5 .cse7))) (.cse1 (= (bvadd (let ((.cse10 (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse10)) (select .cse8 .cse10))) (_ bv4294967295 32)) (bvneg .cse9))) (.cse2 (= (bvadd .cse9 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= (select .cse8 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 (= (_ bv2 32) main_~i~0)) (and .cse0 .cse1 .cse2 .cse3 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse4 .cse5 .cse6 .cse7 .cse1 .cse2 .cse3))))) [2018-11-23 05:17:52,097 INFO L444 ceAbstractionStarter]: At program point L611-4(lines 611 616) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-11-23 05:17:52,097 INFO L444 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 05:17:52,097 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse5 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse0 (not (= (select .cse5 (_ bv4 32)) main_~s~0.base))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse4 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (.cse3 (= (select .cse7 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 .cse1 (= main_~i~0 (_ bv0 32)) .cse2 .cse3) (let ((.cse8 (bvneg main_~len~0))) (and .cse1 .cse2 .cse4 (= (bvadd (let ((.cse6 (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_int| (select .cse5 .cse6)) (select .cse7 .cse6))) (_ bv4294967295 32)) (bvneg .cse8)) (= (bvadd .cse8 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0) .cse3)) (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 .cse2 .cse4 .cse3 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))) [2018-11-23 05:17:52,097 INFO L448 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-11-23 05:17:52,097 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-11-23 05:17:52,097 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-11-23 05:17:52,097 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 602 621) no Hoare annotation was computed. [2018-11-23 05:17:52,097 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 602 621) no Hoare annotation was computed. [2018-11-23 05:17:52,097 INFO L444 ceAbstractionStarter]: At program point L614(lines 602 621) the Hoare annotation is: false [2018-11-23 05:17:52,098 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 602 621) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 05:17:52,098 INFO L448 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2018-11-23 05:17:52,098 INFO L444 ceAbstractionStarter]: At program point L613(line 613) the Hoare annotation is: (let ((.cse7 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse8 (bvneg main_~len~0)) (.cse6 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) (let ((.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= main_~len~0 .cse6)) (.cse0 (= (bvadd (let ((.cse9 (bvadd main_~s~0.offset (_ bv4 32)))) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse9)) (select .cse7 .cse9))) (_ bv4294967295 32)) (bvneg .cse8))) (.cse4 (= (bvadd .cse8 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse5 (= (select .cse7 (_ bv4 32)) (_ bv0 32)))) (or (and .cse0 (and .cse1 .cse2 .cse3) (= (bvadd main_~expected~0 (_ bv4294967293 32)) (_ bv0 32)) .cse4 .cse5 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 (= main_~expected~0 .cse6) (= main_~i~0 (_ bv0 32)) .cse2 .cse3 .cse0 .cse4 .cse5)))) [2018-11-23 05:17:52,098 INFO L448 ceAbstractionStarter]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2018-11-23 05:17:52,098 INFO L451 ceAbstractionStarter]: At program point sll_get_data_atENTRY(lines 588 594) the Hoare annotation is: true [2018-11-23 05:17:52,098 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atFINAL(lines 588 594) no Hoare annotation was computed. [2018-11-23 05:17:52,098 INFO L444 ceAbstractionStarter]: At program point L589-2(lines 589 592) the Hoare annotation is: (let ((.cse2 (bvsgt |sll_get_data_at_#in~index| (_ bv0 32))) (.cse4 (bvadd |sll_get_data_at_#in~index| (_ bv4294967295 32)))) (or (forall ((v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14) (_ bv4 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| .cse0) .cse1))) (= .cse0 v_main_~s~0.base_BEFORE_CALL_14) (not (= (_ bv0 32) .cse1))))) (let ((.cse3 (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (and .cse2 (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) .cse3)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) .cse3)) (= .cse4 sll_get_data_at_~index))) (and .cse2 (bvsgt .cse4 (_ bv0 32))) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|)) (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32))))))) [2018-11-23 05:17:52,098 INFO L448 ceAbstractionStarter]: For program point L589-3(lines 589 592) no Hoare annotation was computed. [2018-11-23 05:17:52,098 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atEXIT(lines 588 594) no Hoare annotation was computed. [2018-11-23 05:17:52,098 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-11-23 05:17:52,098 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-11-23 05:17:52,099 INFO L451 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-11-23 05:17:52,099 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-11-23 05:17:52,099 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-11-23 05:17:52,099 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-11-23 05:17:52,102 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) 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:123) 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) [2018-11-23 05:17:52,104 INFO L168 Benchmark]: Toolchain (without parser) took 86443.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.8 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 375.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,104 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:17:52,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 406.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 944.4 MB in the beginning and 1.2 GB in the end (delta: -212.1 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,105 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,105 INFO L168 Benchmark]: Boogie Preprocessor took 24.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,105 INFO L168 Benchmark]: RCFGBuilder took 297.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,105 INFO L168 Benchmark]: TraceAbstraction took 85691.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.0 MB). Peak memory consumption was 386.0 MB. Max. memory is 11.5 GB. [2018-11-23 05:17:52,106 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 406.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 944.4 MB in the beginning and 1.2 GB in the end (delta: -212.1 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 85691.74 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 90.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -3.0 MB). Peak memory consumption was 386.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...