./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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 abd6dbc145d5f477746656086724ee83e0738836 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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 abd6dbc145d5f477746656086724ee83e0738836 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-635dfa2 [2018-12-03 05:28:22,020 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:28:22,021 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:28:22,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:28:22,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:28:22,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:28:22,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:28:22,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:28:22,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:28:22,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:28:22,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:28:22,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:28:22,032 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:28:22,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:28:22,033 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:28:22,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:28:22,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:28:22,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:28:22,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:28:22,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:28:22,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:28:22,037 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:28:22,038 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:28:22,039 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:28:22,039 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:28:22,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:28:22,040 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:28:22,040 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:28:22,041 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:28:22,041 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:28:22,041 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:28:22,042 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:28:22,042 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:28:22,042 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:28:22,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:28:22,043 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:28:22,043 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 05:28:22,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:28:22,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:28:22,051 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:28:22,052 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:28:22,052 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:28:22,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:28:22,052 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:28:22,052 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 05:28:22,052 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:28:22,052 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:28:22,052 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 05:28:22,053 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 05:28:22,053 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:28:22,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:28:22,053 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:28:22,053 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 05:28:22,053 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:28:22,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:28:22,054 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:28:22,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:28:22,054 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:28:22,054 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:28:22,054 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:28:22,054 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:28:22,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:28:22,054 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:28:22,054 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:28:22,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:28:22,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:28:22,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:28:22,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:28:22,055 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:28:22,055 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 05:28:22,055 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:28:22,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 05:28:22,055 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 05:28:22,055 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_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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 -> abd6dbc145d5f477746656086724ee83e0738836 [2018-12-03 05:28:22,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:28:22,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:28:22,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:28:22,083 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:28:22,083 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:28:22,084 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 05:28:22,119 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data/8935b6df7/4970b2dc5b144e6c965bf0a70c7d4462/FLAG9564a23df [2018-12-03 05:28:22,557 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:28:22,558 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 05:28:22,564 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data/8935b6df7/4970b2dc5b144e6c965bf0a70c7d4462/FLAG9564a23df [2018-12-03 05:28:22,572 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data/8935b6df7/4970b2dc5b144e6c965bf0a70c7d4462 [2018-12-03 05:28:22,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:28:22,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:28:22,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:28:22,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:28:22,577 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:28:22,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@586b3ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22, skipping insertion in model container [2018-12-03 05:28:22,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:28:22,602 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:28:22,748 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:28:22,754 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:28:22,830 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:28:22,852 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:28:22,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22 WrapperNode [2018-12-03 05:28:22,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:28:22,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:28:22,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:28:22,852 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:28:22,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:28:22,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:28:22,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:28:22,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:28:22,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,878 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,878 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... [2018-12-03 05:28:22,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:28:22,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:28:22,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:28:22,889 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:28:22,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:28:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 05:28:22,920 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 05:28:22,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 05:28:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 05:28:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 05:28:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-03 05:28:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-03 05:28:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 05:28:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 05:28:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 05:28:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 05:28:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-12-03 05:28:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-12-03 05:28:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 05:28:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 05:28:22,921 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-03 05:28:22,921 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-03 05:28:22,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 05:28:22,922 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-03 05:28:22,922 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-03 05:28:22,922 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-12-03 05:28:22,922 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-12-03 05:28:22,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:28:22,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:28:23,114 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:28:23,115 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 05:28:23,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:23 BoogieIcfgContainer [2018-12-03 05:28:23,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:28:23,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:28:23,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:28:23,118 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:28:23,118 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:28:22" (1/3) ... [2018-12-03 05:28:23,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146e2e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:28:23, skipping insertion in model container [2018-12-03 05:28:23,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:28:22" (2/3) ... [2018-12-03 05:28:23,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146e2e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:28:23, skipping insertion in model container [2018-12-03 05:28:23,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:23" (3/3) ... [2018-12-03 05:28:23,121 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 05:28:23,127 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:28:23,131 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 05:28:23,140 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 05:28:23,157 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:28:23,157 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:28:23,157 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:28:23,157 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:28:23,157 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:28:23,157 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:28:23,157 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:28:23,157 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:28:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-12-03 05:28:23,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 05:28:23,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:28:23,174 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] [2018-12-03 05:28:23,176 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:28:23,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:28:23,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1072166703, now seen corresponding path program 1 times [2018-12-03 05:28:23,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:28:23,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:28:23,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:28:23,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:28:23,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:28:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:28:23,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:28:23,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:28:23,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:28:23,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:28:23,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:28:23,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:28:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:28:23,330 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 5 states. [2018-12-03 05:28:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:28:23,381 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2018-12-03 05:28:23,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:28:23,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-03 05:28:23,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:28:23,388 INFO L225 Difference]: With dead ends: 101 [2018-12-03 05:28:23,388 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 05:28:23,390 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-12-03 05:28:23,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 05:28:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-03 05:28:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 05:28:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-03 05:28:23,416 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 32 [2018-12-03 05:28:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:28:23,416 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-03 05:28:23,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:28:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-03 05:28:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 05:28:23,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:28:23,418 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:28:23,418 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:28:23,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:28:23,418 INFO L82 PathProgramCache]: Analyzing trace with hash 35479273, now seen corresponding path program 1 times [2018-12-03 05:28:23,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:28:23,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:28:23,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:28:23,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:28:23,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:28:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:28:23,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 05:28:23,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:28:23,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:28:23,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:28:23,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:28:23,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:28:23,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:28:23,477 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-12-03 05:28:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:28:23,507 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-12-03 05:28:23,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:28:23,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-12-03 05:28:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:28:23,508 INFO L225 Difference]: With dead ends: 67 [2018-12-03 05:28:23,509 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 05:28:23,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:28:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 05:28:23,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-03 05:28:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 05:28:23,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-03 05:28:23,516 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 40 [2018-12-03 05:28:23,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:28:23,516 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-03 05:28:23,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:28:23,516 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-03 05:28:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 05:28:23,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:28:23,517 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:28:23,517 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:28:23,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:28:23,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1184429299, now seen corresponding path program 1 times [2018-12-03 05:28:23,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:28:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:28:23,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:28:23,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:28:23,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:28:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:28:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 05:28:23,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:28:23,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:28:23,574 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-03 05:28:23,575 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-03 05:28:23,595 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:28:23,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:28:23,761 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 05:28:23,762 INFO L272 AbstractInterpreter]: Visited 33 different actions 66 times. Merged at 8 different actions 11 times. Never widened. Performed 652 root evaluator evaluations with a maximum evaluation depth of 4. Performed 652 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 31 variables. [2018-12-03 05:28:23,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:28:23,769 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 05:28:23,860 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2018-12-03 05:28:23,860 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 05:28:24,052 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-03 05:28:24,053 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 05:28:24,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 05:28:24,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-12-03 05:28:24,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:28:24,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 05:28:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 05:28:24,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-12-03 05:28:24,055 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 20 states. [2018-12-03 05:28:25,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:28:25,099 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2018-12-03 05:28:25,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 05:28:25,099 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-12-03 05:28:25,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:28:25,101 INFO L225 Difference]: With dead ends: 88 [2018-12-03 05:28:25,101 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 05:28:25,102 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2018-12-03 05:28:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 05:28:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2018-12-03 05:28:25,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 05:28:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2018-12-03 05:28:25,108 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 48 [2018-12-03 05:28:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:28:25,108 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-12-03 05:28:25,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 05:28:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-12-03 05:28:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 05:28:25,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:28:25,109 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:28:25,110 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:28:25,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:28:25,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1276480668, now seen corresponding path program 1 times [2018-12-03 05:28:25,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:28:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:28:25,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:28:25,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:28:25,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:28:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:28:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:28:25,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:28:25,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:28:25,794 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-03 05:28:25,794 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-03 05:28:25,796 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:28:25,796 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:28:25,836 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 05:28:25,836 INFO L272 AbstractInterpreter]: Visited 45 different actions 95 times. Merged at 13 different actions 19 times. Never widened. Performed 807 root evaluator evaluations with a maximum evaluation depth of 4. Performed 807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 5 different actions. Largest state had 31 variables. [2018-12-03 05:28:25,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:28:25,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 05:28:25,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:28:25,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:28:25,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:28:25,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:28:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:28:25,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:28:25,911 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-12-03 05:28:25,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:28:25,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:25,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 05:28:26,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:28:26,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:28:26,023 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-12-03 05:28:26,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-03 05:28:26,055 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-12-03 05:28:26,056 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-12-03 05:28:26,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-03 05:28:26,095 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 28 treesize of output 24 [2018-12-03 05:28:26,097 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 11 [2018-12-03 05:28:26,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,105 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-12-03 05:28:26,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-12-03 05:28:26,341 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 13 treesize of output 10 [2018-12-03 05:28:26,343 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 10 treesize of output 9 [2018-12-03 05:28:26,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-03 05:28:26,395 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 39 treesize of output 35 [2018-12-03 05:28:26,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:28:26,398 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 32 treesize of output 26 [2018-12-03 05:28:26,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,408 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-12-03 05:28:26,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:35 [2018-12-03 05:28:26,922 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int) (sll_circular_update_at_~data Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ sll_circular_update_at_~head.offset 4) sll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-03 05:28:26,932 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-12-03 05:28:26,934 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-12-03 05:28:26,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-03 05:28:26,948 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 18 treesize of output 14 [2018-12-03 05:28:26,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:28:26,953 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 5 treesize of output 1 [2018-12-03 05:28:26,953 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:28:26,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:26,962 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:56, output treesize:16 [2018-12-03 05:28:27,190 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 37 treesize of output 37 [2018-12-03 05:28:27,192 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:28:27,193 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 29 treesize of output 10 [2018-12-03 05:28:27,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:28:27,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:27,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:28:27,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:10 [2018-12-03 05:28:27,261 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 05:28:27,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:28:29,676 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-03 05:28:29,680 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 05:28:29,843 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 05:28:29,848 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 05:28:43,188 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 71 [2018-12-03 05:28:43,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 05:28:43,195 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 05:28:52,491 WARN L180 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-12-03 05:28:52,494 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 05:29:05,883 WARN L180 SmtUtils]: Spent 2.66 s on a formula simplification that was a NOOP. DAG size: 73 [2018-12-03 05:29:05,931 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 68 treesize of output 59 [2018-12-03 05:29:05,949 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 11 treesize of output 10 [2018-12-03 05:29:05,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:05,967 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 20 treesize of output 16 [2018-12-03 05:29:05,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, 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 3 [2018-12-03 05:29:05,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:05,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:05,972 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-12-03 05:29:05,973 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 8 treesize of output 1 [2018-12-03 05:29:05,973 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:05,976 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:05,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 05:29:06,018 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,020 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,021 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,025 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,026 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,028 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,054 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,056 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,072 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 57 treesize of output 49 [2018-12-03 05:29:06,085 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 11 treesize of output 10 [2018-12-03 05:29:06,085 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,096 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 28 treesize of output 26 [2018-12-03 05:29:06,098 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 8 treesize of output 1 [2018-12-03 05:29:06,098 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,101 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,103 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 20 treesize of output 16 [2018-12-03 05:29:06,104 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 3 [2018-12-03 05:29:06,105 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,106 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,121 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-03 05:29:06,141 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-12-03 05:29:06,142 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:137, output treesize:65 [2018-12-03 05:29:06,210 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-03 05:29:06,547 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-12-03 05:29:06,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,715 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 82 treesize of output 73 [2018-12-03 05:29:06,734 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 11 treesize of output 10 [2018-12-03 05:29:06,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,755 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 22 treesize of output 26 [2018-12-03 05:29:06,757 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 13 [2018-12-03 05:29:06,757 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,769 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 18 treesize of output 18 [2018-12-03 05:29:06,770 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-03 05:29:06,778 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 9 [2018-12-03 05:29:06,778 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,783 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 05:29:06,784 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-12-03 05:29:06,786 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 8 treesize of output 1 [2018-12-03 05:29:06,786 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,790 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-03 05:29:06,889 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,894 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,896 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,901 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,902 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,906 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,907 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,911 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,912 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,916 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,916 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,920 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:06,922 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,927 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:06,995 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 82 treesize of output 73 [2018-12-03 05:29:07,015 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 11 treesize of output 10 [2018-12-03 05:29:07,015 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,040 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 22 treesize of output 26 [2018-12-03 05:29:07,047 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 18 treesize of output 18 [2018-12-03 05:29:07,048 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-12-03 05:29:07,057 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 21 treesize of output 17 [2018-12-03 05:29:07,058 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,068 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-12-03 05:29:07,068 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,081 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 05:29:07,084 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 33 treesize of output 31 [2018-12-03 05:29:07,086 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 8 treesize of output 1 [2018-12-03 05:29:07,086 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,094 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,116 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-03 05:29:07,198 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 13 xjuncts. [2018-12-03 05:29:07,198 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 8 variables, input treesize:165, output treesize:348 [2018-12-03 05:29:07,199 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2018-12-03 05:29:07,728 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 37 treesize of output 31 [2018-12-03 05:29:07,730 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-12-03 05:29:07,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-12-03 05:29:07,751 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 34 treesize of output 33 [2018-12-03 05:29:07,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-12-03 05:29:07,772 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-03 05:29:07,793 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 17 treesize of output 15 [2018-12-03 05:29:07,794 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-12-03 05:29:07,794 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,796 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,797 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-03 05:29:07,803 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 19 treesize of output 4 [2018-12-03 05:29:07,803 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,805 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,823 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 30 treesize of output 32 [2018-12-03 05:29:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-03 05:29:07,833 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,841 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 8 [2018-12-03 05:29:07,841 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,848 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 19 treesize of output 4 [2018-12-03 05:29:07,848 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,857 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:07,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 05:29:07,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 05:29:07,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-03 05:29:07,873 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:37, output treesize:9 [2018-12-03 05:29:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:29:08,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:29:08,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 29] total 79 [2018-12-03 05:29:08,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:29:08,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 05:29:08,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 05:29:08,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=5747, Unknown=16, NotChecked=152, Total=6162 [2018-12-03 05:29:08,285 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 55 states. [2018-12-03 05:29:12,087 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-12-03 05:29:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:16,641 INFO L93 Difference]: Finished difference Result 139 states and 183 transitions. [2018-12-03 05:29:16,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 05:29:16,642 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 57 [2018-12-03 05:29:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:16,643 INFO L225 Difference]: With dead ends: 139 [2018-12-03 05:29:16,643 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 05:29:16,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 111 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2564 ImplicationChecksByTransitivity, 48.6s TimeCoverageRelationStatistics Valid=689, Invalid=11720, Unknown=27, NotChecked=220, Total=12656 [2018-12-03 05:29:16,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 05:29:16,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2018-12-03 05:29:16,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 05:29:16,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2018-12-03 05:29:16,658 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 120 transitions. Word has length 57 [2018-12-03 05:29:16,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:16,659 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 120 transitions. [2018-12-03 05:29:16,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 05:29:16,659 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 120 transitions. [2018-12-03 05:29:16,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 05:29:16,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:16,660 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:29:16,660 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:16,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:16,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1399081879, now seen corresponding path program 1 times [2018-12-03 05:29:16,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:29:16,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:16,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:16,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:16,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:29:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 05:29:16,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:16,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:29:16,706 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-03 05:29:16,706 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-03 05:29:16,707 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:29:16,707 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:29:16,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 05:29:16,742 INFO L272 AbstractInterpreter]: Visited 46 different actions 84 times. Merged at 10 different actions 13 times. Never widened. Performed 666 root evaluator evaluations with a maximum evaluation depth of 4. Performed 666 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 4 different actions. Largest state had 31 variables. [2018-12-03 05:29:16,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:16,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 05:29:16,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:16,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:16,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:16,752 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:29:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:16,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 05:29:16,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:16,851 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 05:29:16,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 05:29:16,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-12-03 05:29:16,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:29:16,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:29:16,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:29:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:29:16,867 INFO L87 Difference]: Start difference. First operand 95 states and 120 transitions. Second operand 5 states. [2018-12-03 05:29:16,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:16,894 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2018-12-03 05:29:16,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:29:16,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-03 05:29:16,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:16,895 INFO L225 Difference]: With dead ends: 135 [2018-12-03 05:29:16,895 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 05:29:16,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:29:16,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 05:29:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-12-03 05:29:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 05:29:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2018-12-03 05:29:16,909 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 58 [2018-12-03 05:29:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:16,910 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2018-12-03 05:29:16,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:29:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2018-12-03 05:29:16,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 05:29:16,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:16,911 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:29:16,912 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:16,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash -943903267, now seen corresponding path program 2 times [2018-12-03 05:29:16,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:29:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:16,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:16,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:16,913 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:29:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:16,984 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 05:29:16,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:16,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:29:16,984 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:29:16,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:29:16,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:16,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:17,000 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:29:17,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 05:29:17,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 05:29:17,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:29:17,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:29:17,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:29:17,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:29:17,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-03 05:29:17,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:29:17,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:29:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:29:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:29:17,135 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 8 states. [2018-12-03 05:29:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:17,194 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2018-12-03 05:29:17,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 05:29:17,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-12-03 05:29:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:17,196 INFO L225 Difference]: With dead ends: 164 [2018-12-03 05:29:17,196 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 05:29:17,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 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-12-03 05:29:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 05:29:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-12-03 05:29:17,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 05:29:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-12-03 05:29:17,208 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 58 [2018-12-03 05:29:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:17,209 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-12-03 05:29:17,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:29:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-12-03 05:29:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 05:29:17,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:17,210 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:29:17,210 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:17,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:17,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1842889591, now seen corresponding path program 3 times [2018-12-03 05:29:17,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:29:17,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:17,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:29:17,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:17,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:29:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 05:29:17,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:17,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:29:17,238 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:29:17,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:29:17,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:17,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:17,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 05:29:17,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 05:29:17,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 05:29:17,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:29:17,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:17,311 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 05:29:17,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 05:29:17,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 05:29:17,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 05:29:17,369 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 05:29:17,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 05:29:17,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 05:29:17,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:29:17,369 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 8 states. [2018-12-03 05:29:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:17,416 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2018-12-03 05:29:17,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:29:17,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-12-03 05:29:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:17,418 INFO L225 Difference]: With dead ends: 149 [2018-12-03 05:29:17,418 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 05:29:17,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 110 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-12-03 05:29:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 05:29:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2018-12-03 05:29:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 05:29:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2018-12-03 05:29:17,432 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 58 [2018-12-03 05:29:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:17,432 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2018-12-03 05:29:17,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 05:29:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2018-12-03 05:29:17,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 05:29:17,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:17,433 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:29:17,433 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:17,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:17,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1894997614, now seen corresponding path program 4 times [2018-12-03 05:29:17,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:29:17,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:17,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:29:17,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:17,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:29:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 05:29:17,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:17,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:29:17,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:29:17,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:29:17,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:17,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:17,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:17,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:29:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:17,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 05:29:17,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 05:29:17,622 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 05:29:17,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 14 [2018-12-03 05:29:17,622 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:29:17,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:29:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:29:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:29:17,623 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 6 states. [2018-12-03 05:29:17,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:17,656 INFO L93 Difference]: Finished difference Result 167 states and 198 transitions. [2018-12-03 05:29:17,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:29:17,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-03 05:29:17,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:17,657 INFO L225 Difference]: With dead ends: 167 [2018-12-03 05:29:17,657 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 05:29:17,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-03 05:29:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 05:29:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-12-03 05:29:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 05:29:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-12-03 05:29:17,671 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 65 [2018-12-03 05:29:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:17,671 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-12-03 05:29:17,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:29:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-12-03 05:29:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 05:29:17,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:17,672 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:29:17,672 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:17,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:17,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2144446540, now seen corresponding path program 5 times [2018-12-03 05:29:17,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:29:17,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:17,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:17,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:17,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:29:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 05:29:17,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:17,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:29:17,708 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 05:29:17,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 05:29:17,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:17,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:17,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:29:17,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 05:29:17,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 05:29:17,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:29:17,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 05:29:17,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 05:29:17,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 05:29:17,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2018-12-03 05:29:17,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:29:17,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:29:17,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:29:17,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:29:17,809 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 6 states. [2018-12-03 05:29:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:17,841 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-12-03 05:29:17,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:29:17,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-03 05:29:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:17,841 INFO L225 Difference]: With dead ends: 104 [2018-12-03 05:29:17,841 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 05:29:17,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:29:17,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 05:29:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 05:29:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 05:29:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-12-03 05:29:17,847 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 65 [2018-12-03 05:29:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:17,847 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-12-03 05:29:17,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:29:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-12-03 05:29:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:29:17,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:17,847 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, 1, 1, 1, 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-12-03 05:29:17,848 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:17,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash -592708753, now seen corresponding path program 1 times [2018-12-03 05:29:17,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:29:17,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:17,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:29:17,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:17,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:29:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:29:17,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:17,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:29:17,873 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-12-03 05:29:17,873 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-03 05:29:17,875 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:29:17,875 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:29:17,912 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 05:29:17,912 INFO L272 AbstractInterpreter]: Visited 47 different actions 104 times. Merged at 15 different actions 21 times. Never widened. Performed 879 root evaluator evaluations with a maximum evaluation depth of 4. Performed 879 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 6 different actions. Largest state had 31 variables. [2018-12-03 05:29:17,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:17,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 05:29:17,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:17,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:17,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:17,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:29:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:17,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:29:17,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:18,000 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:29:18,015 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 05:29:18,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-12-03 05:29:18,015 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 05:29:18,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 05:29:18,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 05:29:18,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 05:29:18,015 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-12-03 05:29:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:18,050 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-03 05:29:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 05:29:18,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 05:29:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:18,050 INFO L225 Difference]: With dead ends: 64 [2018-12-03 05:29:18,050 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 05:29:18,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 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-12-03 05:29:18,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 05:29:18,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 05:29:18,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 05:29:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-03 05:29:18,057 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 67 [2018-12-03 05:29:18,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:18,057 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-03 05:29:18,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 05:29:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-03 05:29:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 05:29:18,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:18,058 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, 1, 1, 1, 1, 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-12-03 05:29:18,058 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:18,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:18,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1121174764, now seen corresponding path program 1 times [2018-12-03 05:29:18,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 05:29:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:18,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:18,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 05:29:18,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 05:29:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-03 05:29:19,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:19,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 05:29:19,435 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-12-03 05:29:19,435 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-03 05:29:19,437 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 05:29:19,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 05:29:19,486 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 05:29:19,486 INFO L272 AbstractInterpreter]: Visited 48 different actions 135 times. Merged at 21 different actions 42 times. Never widened. Performed 970 root evaluator evaluations with a maximum evaluation depth of 4. Performed 970 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 7 different actions. Largest state had 31 variables. [2018-12-03 05:29:19,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:19,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 05:29:19,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:19,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:19,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:19,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 05:29:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:19,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:19,557 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-12-03 05:29:19,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:19,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:19,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 05:29:19,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:19,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:19,688 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-12-03 05:29:19,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:19,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:19,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-03 05:29:19,716 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-12-03 05:29:19,718 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-12-03 05:29:19,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:19,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:19,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:19,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-03 05:29:19,750 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 28 treesize of output 24 [2018-12-03 05:29:19,751 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 11 [2018-12-03 05:29:19,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:19,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:19,757 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-12-03 05:29:19,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-12-03 05:29:20,402 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2018-12-03 05:29:20,409 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 39 treesize of output 35 [2018-12-03 05:29:20,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:20,412 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 32 treesize of output 26 [2018-12-03 05:29:20,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:20,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:20,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:20,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:26 [2018-12-03 05:29:20,559 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 25 treesize of output 18 [2018-12-03 05:29:20,561 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 18 treesize of output 17 [2018-12-03 05:29:20,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:20,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:20,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:20,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:113 [2018-12-03 05:29:20,658 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 117 treesize of output 118 [2018-12-03 05:29:20,661 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 32 treesize of output 1 [2018-12-03 05:29:20,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:20,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:20,680 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 97 treesize of output 87 [2018-12-03 05:29:20,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-12-03 05:29:20,688 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 05:29:20,695 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 05:29:20,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 05:29:20,709 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:112 [2018-12-03 05:29:21,295 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 102 treesize of output 96 [2018-12-03 05:29:21,302 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 92 treesize of output 86 [2018-12-03 05:29:21,303 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,383 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 86 treesize of output 78 [2018-12-03 05:29:21,384 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,461 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2018-12-03 05:29:21,464 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 05:29:21,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 05:29:21,568 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 78 treesize of output 76 [2018-12-03 05:29:21,571 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-03 05:29:21,572 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,598 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 72 treesize of output 66 [2018-12-03 05:29:21,599 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,624 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 66 treesize of output 62 [2018-12-03 05:29:21,625 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,646 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-03 05:29:21,648 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 78 treesize of output 68 [2018-12-03 05:29:21,650 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 23 treesize of output 19 [2018-12-03 05:29:21,650 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,660 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 34 treesize of output 28 [2018-12-03 05:29:21,660 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,668 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,674 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 74 treesize of output 72 [2018-12-03 05:29:21,676 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 68 treesize of output 64 [2018-12-03 05:29:21,677 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,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 64 treesize of output 58 [2018-12-03 05:29:21,697 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:21,721 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2018-12-03 05:29:21,722 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-03 05:29:21,747 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-03 05:29:21,822 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 62 treesize of output 60 [2018-12-03 05:29:21,824 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 56 treesize of output 41 [2018-12-03 05:29:21,824 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,847 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:29:21,847 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 52 treesize of output 23 [2018-12-03 05:29:21,848 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,864 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,865 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 58 treesize of output 48 [2018-12-03 05:29:21,868 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:29:21,868 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 36 treesize of output 7 [2018-12-03 05:29:21,868 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,873 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,874 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 58 treesize of output 48 [2018-12-03 05:29:21,877 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:29:21,877 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 36 treesize of output 7 [2018-12-03 05:29:21,877 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,882 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,888 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 58 treesize of output 56 [2018-12-03 05:29:21,890 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:29:21,891 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 48 treesize of output 19 [2018-12-03 05:29:21,891 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,907 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,912 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 58 treesize of output 56 [2018-12-03 05:29:21,914 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 52 treesize of output 37 [2018-12-03 05:29:21,914 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,934 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:29:21,934 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 48 treesize of output 19 [2018-12-03 05:29:21,934 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,953 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,954 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 36 treesize of output 30 [2018-12-03 05:29:21,956 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 22 treesize of output 7 [2018-12-03 05:29:21,956 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,959 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:21,981 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:105, output treesize:10 [2018-12-03 05:29:22,027 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-03 05:29:22,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:23,307 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,321 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,327 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,328 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,334 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,489 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,494 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,495 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,499 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,500 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,505 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,506 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,511 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 89 [2018-12-03 05:29:23,698 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 73 treesize of output 72 [2018-12-03 05:29:23,698 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:23,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 86 [2018-12-03 05:29:23,734 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-03 05:29:23,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 72 treesize of output 60 [2018-12-03 05:29:23,767 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 1 [2018-12-03 05:29:23,767 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:23,772 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 37 treesize of output 33 [2018-12-03 05:29:23,773 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,777 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,805 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2018-12-03 05:29:23,807 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 40 treesize of output 31 [2018-12-03 05:29:23,807 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:23,811 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:23,812 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2018-12-03 05:29:23,817 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2018-12-03 05:29:23,818 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 05:29:23,825 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 05:29:23,865 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 68 treesize of output 66 [2018-12-03 05:29:23,867 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 50 treesize of output 46 [2018-12-03 05:29:23,867 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:23,882 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2018-12-03 05:29:23,882 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 05:29:23,896 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 05:29:23,936 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-03 05:29:23,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 92 [2018-12-03 05:29:23,954 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 66 treesize of output 65 [2018-12-03 05:29:23,954 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:23,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 70 [2018-12-03 05:29:23,981 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,000 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-12-03 05:29:24,005 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2018-12-03 05:29:24,006 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 05:29:24,014 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 05:29:24,032 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 24 treesize of output 28 [2018-12-03 05:29:24,033 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 23 treesize of output 13 [2018-12-03 05:29:24,034 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,049 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-12-03 05:29:24,049 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,052 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,055 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:24,057 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:29:24,058 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 97 treesize of output 83 [2018-12-03 05:29:24,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:24,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-12-03 05:29:24,061 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,069 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2018-12-03 05:29:24,070 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-12-03 05:29:24,070 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,074 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,078 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,079 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:24,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 96 [2018-12-03 05:29:24,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:24,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 85 [2018-12-03 05:29:24,085 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:24,092 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-12-03 05:29:24,093 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 40 treesize of output 31 [2018-12-03 05:29:24,093 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,096 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,099 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,167 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 45 treesize of output 23 [2018-12-03 05:29:24,168 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 5 [2018-12-03 05:29:24,169 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,173 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,174 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 59 treesize of output 37 [2018-12-03 05:29:24,175 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 5 [2018-12-03 05:29:24,175 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,176 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,219 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,225 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,225 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,232 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,233 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,239 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,278 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,283 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,284 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,288 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,289 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,294 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,343 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 97 treesize of output 69 [2018-12-03 05:29:24,346 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 35 treesize of output 5 [2018-12-03 05:29:24,346 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,348 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,350 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 97 treesize of output 69 [2018-12-03 05:29:24,353 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 35 treesize of output 5 [2018-12-03 05:29:24,353 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,355 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:24,388 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:29:24,388 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 33 treesize of output 44 [2018-12-03 05:29:24,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:24,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-03 05:29:24,391 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,396 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 12 treesize of output 6 [2018-12-03 05:29:24,398 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-03 05:29:24,398 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,399 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,401 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 92 [2018-12-03 05:29:24,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 70 [2018-12-03 05:29:24,419 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,441 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 32 treesize of output 31 [2018-12-03 05:29:24,441 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 23 [2018-12-03 05:29:24,464 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 10 treesize of output 8 [2018-12-03 05:29:24,464 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,468 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 8 treesize of output 1 [2018-12-03 05:29:24,468 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,471 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,491 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 58 treesize of output 60 [2018-12-03 05:29:24,496 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2018-12-03 05:29:24,497 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 05:29:24,518 INFO L267 ElimStorePlain]: Start of recursive call 77: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 05:29:24,523 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:24,524 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 33 treesize of output 31 [2018-12-03 05:29:24,526 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 31 treesize of output 29 [2018-12-03 05:29:24,526 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,528 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-12-03 05:29:24,540 INFO L202 ElimStorePlain]: Needed 80 recursive calls to eliminate 8 variables, input treesize:245, output treesize:75 [2018-12-03 05:29:24,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,763 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,772 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,780 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,781 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,789 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,913 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,922 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,922 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,931 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,931 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:24,939 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:25,057 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 83 treesize of output 67 [2018-12-03 05:29:25,060 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-12-03 05:29:25,060 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,066 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,068 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 85 treesize of output 69 [2018-12-03 05:29:25,071 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-12-03 05:29:25,071 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,080 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,082 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 95 treesize of output 79 [2018-12-03 05:29:25,084 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-12-03 05:29:25,084 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,091 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,194 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:25,205 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:25,207 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:25,220 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:25,222 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:25,231 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:25,331 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,336 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,337 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:25,342 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:25,342 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,348 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,420 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 85 treesize of output 69 [2018-12-03 05:29:25,421 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 23 treesize of output 5 [2018-12-03 05:29:25,422 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,425 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,427 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 85 treesize of output 69 [2018-12-03 05:29:25,428 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 23 treesize of output 5 [2018-12-03 05:29:25,428 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,432 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:25,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-12-03 05:29:25,469 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 6 variables, input treesize:197, output treesize:289 [2018-12-03 05:29:25,470 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-03 05:29:26,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:26,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:26,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:26,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:26,258 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:26,261 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:26,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 05:29:26,269 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:106, output treesize:24 [2018-12-03 05:29:26,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:26,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:26,828 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:29:26,830 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:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) 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-12-03 05:29:26,836 INFO L168 Benchmark]: Toolchain (without parser) took 64262.27 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.8 MB). Free memory was 957.1 MB in the beginning and 1.3 GB in the end (delta: -375.0 MB). Peak memory consumption was 583.2 MB. Max. memory is 11.5 GB. [2018-12-03 05:29:26,838 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:29:26,838 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-03 05:29:26,838 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:29:26,838 INFO L168 Benchmark]: Boogie Preprocessor took 19.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-03 05:29:26,839 INFO L168 Benchmark]: RCFGBuilder took 225.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2018-12-03 05:29:26,839 INFO L168 Benchmark]: TraceAbstraction took 63719.24 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 249.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -270.4 MB). Peak memory consumption was 575.6 MB. Max. memory is 11.5 GB. [2018-12-03 05:29:26,840 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -138.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 63719.24 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 249.6 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -270.4 MB). Peak memory consumption was 575.6 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:347) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 05:29:28,081 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 05:29:28,082 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 05:29:28,088 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 05:29:28,088 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 05:29:28,089 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 05:29:28,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 05:29:28,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 05:29:28,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 05:29:28,091 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 05:29:28,092 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 05:29:28,092 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 05:29:28,092 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 05:29:28,093 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 05:29:28,093 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 05:29:28,094 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 05:29:28,094 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 05:29:28,095 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 05:29:28,096 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 05:29:28,097 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 05:29:28,098 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 05:29:28,098 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 05:29:28,099 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 05:29:28,100 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 05:29:28,100 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 05:29:28,100 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 05:29:28,101 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 05:29:28,101 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 05:29:28,102 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 05:29:28,102 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 05:29:28,102 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 05:29:28,103 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 05:29:28,103 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 05:29:28,103 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 05:29:28,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 05:29:28,104 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 05:29:28,104 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-03 05:29:28,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 05:29:28,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 05:29:28,111 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 05:29:28,112 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 05:29:28,112 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 05:29:28,112 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 05:29:28,112 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 05:29:28,112 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 05:29:28,112 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 05:29:28,112 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 05:29:28,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 05:29:28,112 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 05:29:28,113 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 05:29:28,113 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 05:29:28,114 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 05:29:28,114 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 05:29:28,114 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 05:29:28,114 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 05:29:28,114 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 05:29:28,114 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 05:29:28,114 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 05:29:28,114 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 05:29:28,114 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 05:29:28,114 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 05:29:28,114 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_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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 -> abd6dbc145d5f477746656086724ee83e0738836 [2018-12-03 05:29:28,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 05:29:28,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 05:29:28,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 05:29:28,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 05:29:28,146 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 05:29:28,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 05:29:28,185 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data/1589e7d68/2195d183708941d4b856f816f38b5c10/FLAGd646a9347 [2018-12-03 05:29:28,689 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 05:29:28,689 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 05:29:28,695 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data/1589e7d68/2195d183708941d4b856f816f38b5c10/FLAGd646a9347 [2018-12-03 05:29:28,703 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/data/1589e7d68/2195d183708941d4b856f816f38b5c10 [2018-12-03 05:29:28,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 05:29:28,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 05:29:28,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 05:29:28,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 05:29:28,708 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 05:29:28,709 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:28,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49da4dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28, skipping insertion in model container [2018-12-03 05:29:28,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:28,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 05:29:28,732 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 05:29:28,889 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:29:28,898 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 05:29:28,960 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 05:29:28,983 INFO L195 MainTranslator]: Completed translation [2018-12-03 05:29:28,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28 WrapperNode [2018-12-03 05:29:28,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 05:29:28,984 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 05:29:28,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 05:29:28,984 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 05:29:28,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:29,002 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:29,007 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 05:29:29,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 05:29:29,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 05:29:29,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 05:29:29,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:29,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:29,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:29,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:29,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:29,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:29,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... [2018-12-03 05:29:29,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 05:29:29,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 05:29:29,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 05:29:29,034 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 05:29:29,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:29,064 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-03 05:29:29,064 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-03 05:29:29,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 05:29:29,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-03 05:29:29,064 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-03 05:29:29,065 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-03 05:29:29,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 05:29:29,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 05:29:29,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 05:29:29,065 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 05:29:29,065 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-12-03 05:29:29,065 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-12-03 05:29:29,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-03 05:29:29,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 05:29:29,065 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-03 05:29:29,065 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-03 05:29:29,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 05:29:29,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-03 05:29:29,066 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-03 05:29:29,066 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-03 05:29:29,066 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-12-03 05:29:29,066 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-12-03 05:29:29,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 05:29:29,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 05:29:29,277 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 05:29:29,278 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 05:29:29,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:29:29 BoogieIcfgContainer [2018-12-03 05:29:29,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 05:29:29,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 05:29:29,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 05:29:29,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 05:29:29,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 05:29:28" (1/3) ... [2018-12-03 05:29:29,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce11909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:29:29, skipping insertion in model container [2018-12-03 05:29:29,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 05:29:28" (2/3) ... [2018-12-03 05:29:29,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce11909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:29:29, skipping insertion in model container [2018-12-03 05:29:29,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:29:29" (3/3) ... [2018-12-03 05:29:29,283 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-03 05:29:29,289 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 05:29:29,293 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 05:29:29,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 05:29:29,317 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 05:29:29,318 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 05:29:29,318 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 05:29:29,318 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 05:29:29,318 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 05:29:29,318 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 05:29:29,318 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 05:29:29,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 05:29:29,318 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 05:29:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-12-03 05:29:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 05:29:29,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:29,331 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] [2018-12-03 05:29:29,333 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:29,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:29,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1776900725, now seen corresponding path program 1 times [2018-12-03 05:29:29,338 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:29:29,338 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:29:29,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:29,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:29:29,453 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 05:29:29,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:29:29,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 05:29:29,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 05:29:29,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 05:29:29,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 05:29:29,468 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 5 states. [2018-12-03 05:29:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:29,545 INFO L93 Difference]: Finished difference Result 99 states and 131 transitions. [2018-12-03 05:29:29,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:29:29,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-03 05:29:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:29,552 INFO L225 Difference]: With dead ends: 99 [2018-12-03 05:29:29,552 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 05:29:29,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-12-03 05:29:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 05:29:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-12-03 05:29:29,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 05:29:29,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-03 05:29:29,580 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 31 [2018-12-03 05:29:29,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:29,580 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-03 05:29:29,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 05:29:29,580 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-03 05:29:29,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 05:29:29,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:29,582 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:29:29,582 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:29,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1601339917, now seen corresponding path program 1 times [2018-12-03 05:29:29,583 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:29:29,583 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:29:29,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:29,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 05:29:29,674 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 05:29:29,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 05:29:29,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 05:29:29,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 05:29:29,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 05:29:29,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:29:29,678 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-03 05:29:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:29,717 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-12-03 05:29:29,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 05:29:29,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-03 05:29:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:29,720 INFO L225 Difference]: With dead ends: 64 [2018-12-03 05:29:29,720 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 05:29:29,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 05:29:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 05:29:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-12-03 05:29:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 05:29:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-03 05:29:29,728 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2018-12-03 05:29:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:29,728 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-03 05:29:29,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 05:29:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-03 05:29:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 05:29:29,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:29,729 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:29:29,729 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:29,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:29,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1095764041, now seen corresponding path program 1 times [2018-12-03 05:29:29,730 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:29:29,730 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:29:29,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:29,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 05:29:29,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 05:29:29,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:29,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:29,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:29,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:30,139 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 13 treesize of output 10 [2018-12-03 05:29:30,142 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 10 treesize of output 9 [2018-12-03 05:29:30,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:30,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:30,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:30,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-03 05:29:30,444 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-12-03 05:29:30,449 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-12-03 05:29:30,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:30,465 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-12-03 05:29:30,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:30,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:30,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:30,475 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-03 05:29:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 05:29:30,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:31,087 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 9 treesize of output 7 [2018-12-03 05:29:31,090 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 7 treesize of output 3 [2018-12-03 05:29:31,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:31,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:31,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-03 05:29:31,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2018-12-03 05:29:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 05:29:31,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 05:29:31,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 20, 12] total 33 [2018-12-03 05:29:31,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 05:29:31,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 05:29:31,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 05:29:31,217 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 33 states. [2018-12-03 05:29:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:35,049 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2018-12-03 05:29:35,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 05:29:35,049 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-12-03 05:29:35,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:35,051 INFO L225 Difference]: With dead ends: 91 [2018-12-03 05:29:35,051 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 05:29:35,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 05:29:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 05:29:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 47. [2018-12-03 05:29:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 05:29:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-03 05:29:35,057 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 47 [2018-12-03 05:29:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:35,058 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-03 05:29:35,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 05:29:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-03 05:29:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 05:29:35,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:35,059 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:29:35,059 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:35,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:35,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1293558625, now seen corresponding path program 2 times [2018-12-03 05:29:35,059 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:29:35,060 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:29:35,073 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 05:29:35,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 05:29:35,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:29:35,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:35,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:29:35,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:29:35,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:35,248 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:35,254 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 05:29:35,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 05:29:35,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:29:35,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:35,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:29:35,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:29:35,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 05:29:35,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-03 05:29:35,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 05:29:35,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 05:29:35,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:29:35,398 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 9 states. [2018-12-03 05:29:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:29:35,512 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2018-12-03 05:29:35,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:29:35,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-03 05:29:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:29:35,513 INFO L225 Difference]: With dead ends: 92 [2018-12-03 05:29:35,513 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 05:29:35,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 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-12-03 05:29:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 05:29:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-12-03 05:29:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 05:29:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-12-03 05:29:35,522 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 55 [2018-12-03 05:29:35,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:29:35,522 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-12-03 05:29:35,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 05:29:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-12-03 05:29:35,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 05:29:35,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:29:35,523 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:29:35,523 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:29:35,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:29:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1115647387, now seen corresponding path program 1 times [2018-12-03 05:29:35,523 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:29:35,523 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:29:35,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:29:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:35,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:35,668 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-12-03 05:29:35,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:35,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:35,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 05:29:35,727 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:35,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:35,728 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-12-03 05:29:35,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:35,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:35,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-03 05:29:35,758 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-12-03 05:29:35,760 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-12-03 05:29:35,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:35,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:35,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:35,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-03 05:29:35,797 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 28 treesize of output 24 [2018-12-03 05:29:35,799 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 11 [2018-12-03 05:29:35,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:35,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:35,810 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-12-03 05:29:35,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-12-03 05:29:36,026 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 13 treesize of output 10 [2018-12-03 05:29:36,029 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 10 treesize of output 9 [2018-12-03 05:29:36,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:36,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:36,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:36,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-03 05:29:36,115 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 39 treesize of output 35 [2018-12-03 05:29:36,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:36,121 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 32 treesize of output 26 [2018-12-03 05:29:36,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:36,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:36,139 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-12-03 05:29:36,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2018-12-03 05:29:37,936 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-03 05:29:37,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-12-03 05:29:37,950 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 5 treesize of output 1 [2018-12-03 05:29:37,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:37,963 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 24 treesize of output 21 [2018-12-03 05:29:37,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:37,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:38,004 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 23 treesize of output 24 [2018-12-03 05:29:38,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 10 treesize of output 9 [2018-12-03 05:29:38,007 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:38,015 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:38,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:38,029 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:18 [2018-12-03 05:29:40,358 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-12-03 05:29:40,361 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-12-03 05:29:40,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:40,375 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-12-03 05:29:40,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:40,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:40,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:40,388 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-03 05:29:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 05:29:40,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:43,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:29:43,317 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:29:43,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:29:43,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:29:43,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:29:43,364 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-12-03 05:29:43,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 05:29:43,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:43,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:43,373 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-12-03 05:29:43,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-03 05:29:43,385 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-12-03 05:29:43,387 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-12-03 05:29:43,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-03 05:29:43,404 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 28 treesize of output 24 [2018-12-03 05:29:43,407 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 11 [2018-12-03 05:29:43,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,419 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-12-03 05:29:43,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-12-03 05:29:43,430 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 13 treesize of output 10 [2018-12-03 05:29:43,433 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 10 treesize of output 9 [2018-12-03 05:29:43,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-03 05:29:43,469 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 39 treesize of output 35 [2018-12-03 05:29:43,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:43,479 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 32 treesize of output 26 [2018-12-03 05:29:43,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,503 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-12-03 05:29:43,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2018-12-03 05:29:43,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:29:43,528 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-12-03 05:29:43,532 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-12-03 05:29:43,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-03 05:29:43,568 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 5 treesize of output 1 [2018-12-03 05:29:43,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,578 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-12-03 05:29:43,578 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:43,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:29:43,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:43,601 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:18 [2018-12-03 05:29:45,655 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-12-03 05:29:45,658 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-12-03 05:29:45,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:45,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 18 treesize of output 9 [2018-12-03 05:29:45,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 05:29:45,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:45,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:29:45,680 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-03 05:29:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-03 05:29:45,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:29:48,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 05:29:48,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-12-03 05:29:48,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 05:29:48,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 05:29:48,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1232, Unknown=3, NotChecked=70, Total=1406 [2018-12-03 05:29:48,057 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 31 states. [2018-12-03 05:30:16,915 WARN L180 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 05:30:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:30:35,216 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2018-12-03 05:30:35,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 05:30:35,217 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-12-03 05:30:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:30:35,218 INFO L225 Difference]: With dead ends: 116 [2018-12-03 05:30:35,219 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 05:30:35,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=263, Invalid=2917, Unknown=16, NotChecked=110, Total=3306 [2018-12-03 05:30:35,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 05:30:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2018-12-03 05:30:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 05:30:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2018-12-03 05:30:35,234 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 56 [2018-12-03 05:30:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:30:35,234 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2018-12-03 05:30:35,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 05:30:35,234 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2018-12-03 05:30:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 05:30:35,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:30:35,236 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:30:35,236 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:30:35,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:30:35,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1824064388, now seen corresponding path program 1 times [2018-12-03 05:30:35,236 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:30:35,237 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:30:35,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:30:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:30:35,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 05:30:35,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 05:30:35,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 05:30:35,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-12-03 05:30:35,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 05:30:35,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 05:30:35,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 05:30:35,386 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 7 states. [2018-12-03 05:30:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:30:35,433 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2018-12-03 05:30:35,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 05:30:35,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-12-03 05:30:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:30:35,434 INFO L225 Difference]: With dead ends: 126 [2018-12-03 05:30:35,434 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 05:30:35,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 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-12-03 05:30:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 05:30:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-03 05:30:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 05:30:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2018-12-03 05:30:35,446 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 57 [2018-12-03 05:30:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:30:35,446 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2018-12-03 05:30:35,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 05:30:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2018-12-03 05:30:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 05:30:35,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:30:35,447 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:30:35,447 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:30:35,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:30:35,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1508377569, now seen corresponding path program 2 times [2018-12-03 05:30:35,447 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:30:35,447 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:30:35,460 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 05:30:35,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 05:30:35,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:30:35,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:30:35,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:30:35,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:30:35,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 05:30:35,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 05:30:35,810 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 05:30:35,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:30:35,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:30:35,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 05:30:36,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 05:30:36,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-03 05:30:36,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 05:30:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 05:30:36,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-03 05:30:36,268 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 18 states. [2018-12-03 05:30:37,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:30:37,092 INFO L93 Difference]: Finished difference Result 181 states and 237 transitions. [2018-12-03 05:30:37,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 05:30:37,093 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-12-03 05:30:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:30:37,094 INFO L225 Difference]: With dead ends: 181 [2018-12-03 05:30:37,094 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 05:30:37,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 209 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-12-03 05:30:37,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 05:30:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 108. [2018-12-03 05:30:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 05:30:37,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2018-12-03 05:30:37,111 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 57 [2018-12-03 05:30:37,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:30:37,111 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2018-12-03 05:30:37,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 05:30:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2018-12-03 05:30:37,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 05:30:37,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:30:37,112 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:30:37,113 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:30:37,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:30:37,113 INFO L82 PathProgramCache]: Analyzing trace with hash -415933901, now seen corresponding path program 3 times [2018-12-03 05:30:37,113 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:30:37,113 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:30:37,126 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-03 05:30:37,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 05:30:37,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:30:37,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 05:30:37,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:37,365 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 05:30:37,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:30:37,367 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:30:37,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 05:30:37,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 05:30:37,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:30:37,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 05:30:37,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 05:30:37,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 05:30:37,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-03 05:30:37,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 05:30:37,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 05:30:37,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:30:37,553 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand 9 states. [2018-12-03 05:30:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:30:37,699 INFO L93 Difference]: Finished difference Result 153 states and 194 transitions. [2018-12-03 05:30:37,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 05:30:37,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-12-03 05:30:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:30:37,700 INFO L225 Difference]: With dead ends: 153 [2018-12-03 05:30:37,701 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 05:30:37,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-03 05:30:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 05:30:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 05:30:37,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 05:30:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2018-12-03 05:30:37,711 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 64 [2018-12-03 05:30:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:30:37,711 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2018-12-03 05:30:37,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 05:30:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2018-12-03 05:30:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 05:30:37,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:30:37,712 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:30:37,712 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:30:37,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:30:37,712 INFO L82 PathProgramCache]: Analyzing trace with hash 555098392, now seen corresponding path program 1 times [2018-12-03 05:30:37,712 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:30:37,712 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:30:37,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:30:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:30:37,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:37,852 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:30:37,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:30:37,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:30:37,909 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:30:37,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:30:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:30:37,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:30:37,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:30:37,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 05:30:37,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-03 05:30:37,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 05:30:37,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 05:30:37,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-03 05:30:37,997 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand 9 states. [2018-12-03 05:30:38,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:30:38,133 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2018-12-03 05:30:38,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 05:30:38,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-12-03 05:30:38,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:30:38,134 INFO L225 Difference]: With dead ends: 142 [2018-12-03 05:30:38,135 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 05:30:38,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 252 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-12-03 05:30:38,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 05:30:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-12-03 05:30:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 05:30:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2018-12-03 05:30:38,151 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 65 [2018-12-03 05:30:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:30:38,152 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2018-12-03 05:30:38,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 05:30:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-12-03 05:30:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 05:30:38,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:30:38,152 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-03 05:30:38,153 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:30:38,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:30:38,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1599595657, now seen corresponding path program 4 times [2018-12-03 05:30:38,153 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:30:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:30:38,172 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 05:30:38,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 05:30:38,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:30:38,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-03 05:30:38,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:38,350 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 05:30:38,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:30:38,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:30:38,357 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 05:30:38,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 05:30:38,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:30:38,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 05:30:38,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:38,737 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 05:30:38,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 05:30:38,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 11, 9] total 22 [2018-12-03 05:30:38,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 05:30:38,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 05:30:38,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-12-03 05:30:38,753 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 22 states. [2018-12-03 05:30:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:30:39,005 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-12-03 05:30:39,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 05:30:39,006 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-12-03 05:30:39,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:30:39,006 INFO L225 Difference]: With dead ends: 123 [2018-12-03 05:30:39,006 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 05:30:39,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-12-03 05:30:39,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 05:30:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 05:30:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 05:30:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-03 05:30:39,012 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 65 [2018-12-03 05:30:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:30:39,013 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-03 05:30:39,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 05:30:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-03 05:30:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 05:30:39,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:30:39,013 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 05:30:39,013 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:30:39,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:30:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1626914727, now seen corresponding path program 1 times [2018-12-03 05:30:39,014 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:30:39,014 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:30:39,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 05:30:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:30:39,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:39,183 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-12-03 05:30:39,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-03 05:30:39,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:39,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:39,238 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-12-03 05:30:39,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-03 05:30:39,265 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-12-03 05:30:39,267 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-12-03 05:30:39,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-03 05:30:39,302 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 28 treesize of output 24 [2018-12-03 05:30:39,303 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 11 [2018-12-03 05:30:39,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,314 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-12-03 05:30:39,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-12-03 05:30:39,506 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 19 treesize of output 16 [2018-12-03 05:30:39,509 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 16 treesize of output 1 [2018-12-03 05:30:39,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:19 [2018-12-03 05:30:39,589 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 39 treesize of output 35 [2018-12-03 05:30:39,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:39,595 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 32 treesize of output 26 [2018-12-03 05:30:39,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,612 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-12-03 05:30:39,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:31 [2018-12-03 05:30:39,863 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 25 treesize of output 18 [2018-12-03 05:30:39,867 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 18 treesize of output 17 [2018-12-03 05:30:39,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:39,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-12-03 05:30:40,036 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:40,054 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 100 treesize of output 101 [2018-12-03 05:30:40,059 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 32 treesize of output 1 [2018-12-03 05:30:40,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:40,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:40,104 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:30:40,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 89 [2018-12-03 05:30:40,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2018-12-03 05:30:40,142 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-03 05:30:40,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 05:30:40,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 05:30:40,202 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:88 [2018-12-03 05:30:41,165 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 54 treesize of output 52 [2018-12-03 05:30:41,170 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 48 treesize of output 35 [2018-12-03 05:30:41,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:41,202 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 36 treesize of output 9 [2018-12-03 05:30:41,202 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:41,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:41,237 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-12-03 05:30:41,240 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-12-03 05:30:41,240 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:41,252 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-12-03 05:30:41,252 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:41,254 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:41,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:41,257 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:11 [2018-12-03 05:30:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 05:30:41,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:42,571 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-03 05:30:42,692 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-03 05:30:42,776 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 19 treesize of output 13 [2018-12-03 05:30:42,781 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-12-03 05:30:42,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,834 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,838 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,839 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:42,844 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:42,874 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,877 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,878 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:42,881 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:42,882 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,884 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:42,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 05:30:42,905 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:122, output treesize:72 [2018-12-03 05:30:43,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:30:43,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:30:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 05:30:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 05:30:43,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:30:43,108 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-12-03 05:30:43,108 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:43,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:43,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-03 05:30:43,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:43,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:43,396 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-12-03 05:30:43,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:43,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:43,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-03 05:30:43,482 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-12-03 05:30:43,484 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-12-03 05:30:43,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:43,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:43,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:43,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-03 05:30:43,593 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-12-03 05:30:43,595 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-12-03 05:30:43,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:43,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:43,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:43,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-12-03 05:30:44,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 34 treesize of output 33 [2018-12-03 05:30:44,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:44,334 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 22 treesize of output 14 [2018-12-03 05:30:44,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:44,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:44,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:44,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2018-12-03 05:30:44,943 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 25 treesize of output 18 [2018-12-03 05:30:44,947 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 18 treesize of output 17 [2018-12-03 05:30:44,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:44,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:44,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:44,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:107, output treesize:99 [2018-12-03 05:30:45,329 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 101 [2018-12-03 05:30:45,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 101 treesize of output 69 [2018-12-03 05:30:45,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:45,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:45,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 112 [2018-12-03 05:30:45,500 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 88 treesize of output 56 [2018-12-03 05:30:45,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:45,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 57 [2018-12-03 05:30:45,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-03 05:30:45,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-03 05:30:45,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-03 05:30:45,834 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:135, output treesize:94 [2018-12-03 05:30:47,665 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-03 05:30:48,245 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-03 05:30:49,130 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2018-12-03 05:30:51,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:51,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:51,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:51,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:51,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:51,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:51,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:51,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:51,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 139 [2018-12-03 05:30:51,252 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 114 [2018-12-03 05:30:51,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-03 05:30:51,514 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 104 treesize of output 85 [2018-12-03 05:30:51,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:51,689 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 77 treesize of output 58 [2018-12-03 05:30:51,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:51,857 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:30:51,857 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 75 treesize of output 71 [2018-12-03 05:30:51,858 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:52,017 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 56 treesize of output 47 [2018-12-03 05:30:52,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:52,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:52,183 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 15 treesize of output 19 [2018-12-03 05:30:52,185 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:52,208 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 33 treesize of output 33 [2018-12-03 05:30:52,211 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 29 treesize of output 25 [2018-12-03 05:30:52,211 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:52,227 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-12-03 05:30:52,227 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:52,228 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:52,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:52,231 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:109, output treesize:15 [2018-12-03 05:30:52,305 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 05:30:52,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:30:56,403 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-03 05:30:56,655 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-03 05:30:56,813 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-03 05:30:56,995 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-12-03 05:30:57,001 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 42 treesize of output 40 [2018-12-03 05:30:57,006 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 8 treesize of output 1 [2018-12-03 05:30:57,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,029 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 40 treesize of output 34 [2018-12-03 05:30:57,035 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-12-03 05:30:57,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,060 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,065 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:30:57,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 37 treesize of output 36 [2018-12-03 05:30:57,080 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 8 treesize of output 1 [2018-12-03 05:30:57,080 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,114 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-12-03 05:30:57,114 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,122 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,128 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 42 treesize of output 40 [2018-12-03 05:30:57,134 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 8 treesize of output 1 [2018-12-03 05:30:57,134 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,159 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,191 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 37 treesize of output 41 [2018-12-03 05:30:57,199 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 36 treesize of output 28 [2018-12-03 05:30:57,199 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,274 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 28 treesize of output 20 [2018-12-03 05:30:57,274 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,377 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 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-03 05:30:57,378 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-03 05:30:57,397 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,506 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,511 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,512 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,517 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,518 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:57,524 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:57,583 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:57,587 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:57,588 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,592 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,592 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,596 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,645 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 13 treesize of output 11 [2018-12-03 05:30:57,648 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-12-03 05:30:57,648 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,651 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,654 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 41 treesize of output 37 [2018-12-03 05:30:57,660 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 29 treesize of output 25 [2018-12-03 05:30:57,660 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:57,669 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:57,672 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 38 treesize of output 34 [2018-12-03 05:30:57,676 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 29 treesize of output 25 [2018-12-03 05:30:57,676 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:57,687 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-03 05:30:57,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:57,692 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:30:57,693 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 38 treesize of output 46 [2018-12-03 05:30:57,698 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:57,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 42 treesize of output 35 [2018-12-03 05:30:57,699 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,718 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-12-03 05:30:57,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:57,723 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-03 05:30:57,723 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,728 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,742 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,744 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 05:30:57,744 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,745 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-03 05:30:57,746 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:57,752 INFO L683 Elim1Store]: detected equality via solver [2018-12-03 05:30:57,753 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 41 treesize of output 49 [2018-12-03 05:30:57,762 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:57,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 42 treesize of output 35 [2018-12-03 05:30:57,763 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,780 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-12-03 05:30:57,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 05:30:57,784 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-03 05:30:57,784 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,789 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,798 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 05:30:57,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-03 05:30:57,867 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 4 variables, input treesize:162, output treesize:68 [2018-12-03 05:30:58,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 05:30:58,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 39] total 64 [2018-12-03 05:30:58,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 05:30:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 05:30:58,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=6865, Unknown=30, NotChecked=0, Total=7310 [2018-12-03 05:30:58,232 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 64 states. [2018-12-03 05:31:11,432 WARN L180 SmtUtils]: Spent 4.98 s on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-12-03 05:31:18,190 WARN L180 SmtUtils]: Spent 6.38 s on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-12-03 05:31:18,671 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2018-12-03 05:31:24,371 WARN L180 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2018-12-03 05:31:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:31:25,207 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-12-03 05:31:25,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 05:31:25,208 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 66 [2018-12-03 05:31:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:31:25,209 INFO L225 Difference]: With dead ends: 72 [2018-12-03 05:31:25,209 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 05:31:25,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3684 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=875, Invalid=12899, Unknown=32, NotChecked=0, Total=13806 [2018-12-03 05:31:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 05:31:25,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 05:31:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 05:31:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 05:31:25,218 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 66 [2018-12-03 05:31:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:31:25,218 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 05:31:25,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 05:31:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 05:31:25,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 05:31:25,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 05:31:25,219 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, 1, 1, 1, 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-12-03 05:31:25,219 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 05:31:25,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 05:31:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 493482744, now seen corresponding path program 2 times [2018-12-03 05:31:25,219 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 05:31:25,219 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 05:31:25,233 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-03 05:31:25,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 05:31:25,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:31:25,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:31:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:31:25,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:31:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:31:25,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 05:31:25,510 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5cd3dded-9df2-4e4f-bf8d-a7d2f1538c97/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-12-03 05:31:25,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-03 05:31:25,615 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-03 05:31:25,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 05:31:25,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 05:31:25,687 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:31:25,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 05:31:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 05:31:26,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-03 05:31:26,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-03 05:31:26,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 05:31:26,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 05:31:26,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-03 05:31:26,043 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 18 states. [2018-12-03 05:31:26,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 05:31:26,619 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 05:31:26,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 05:31:26,619 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-12-03 05:31:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 05:31:26,619 INFO L225 Difference]: With dead ends: 67 [2018-12-03 05:31:26,619 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 05:31:26,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-03 05:31:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 05:31:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 05:31:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 05:31:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 05:31:26,620 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-12-03 05:31:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 05:31:26,620 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 05:31:26,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 05:31:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 05:31:26,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 05:31:26,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 05:31:27,785 WARN L180 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 117 [2018-12-03 05:31:28,092 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2018-12-03 05:31:28,220 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-03 05:31:28,606 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2018-12-03 05:31:28,851 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-03 05:31:28,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 05:31:28,875 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-03 05:31:28,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 05:31:28,875 INFO L451 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: true [2018-12-03 05:31:28,875 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 560 562) the Hoare annotation is: true [2018-12-03 05:31:28,875 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 560 562) no Hoare annotation was computed. [2018-12-03 05:31:28,875 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 560 562) no Hoare annotation was computed. [2018-12-03 05:31:28,875 INFO L448 ceAbstractionStarter]: For program point sll_circular_get_data_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-12-03 05:31:28,875 INFO L451 ceAbstractionStarter]: At program point sll_circular_get_data_atENTRY(lines 595 601) the Hoare annotation is: true [2018-12-03 05:31:28,876 INFO L444 ceAbstractionStarter]: At program point L596-2(lines 596 599) the Hoare annotation is: (let ((.cse0 (= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|)) (.cse1 (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base)) (.cse2 (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|))) (and (or (and .cse0 .cse1 .cse2) (forall ((v_main_~s~0.base_BEFORE_CALL_21 (_ BitVec 32))) (let ((.cse3 (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_21) (_ bv0 32))) (.cse4 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_21) (_ bv4 32)))) (or (not (= (_ bv0 32) .cse3)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_21) (_ bv0 32))) (bvadd .cse3 (_ bv4 32))) (_ bv4294967295 32)) (bvneg (bvneg .cse4)))) (not (= (bvadd .cse4 (_ bv4294967294 32)) (_ bv0 32)))))) (bvsgt (bvadd |sll_circular_get_data_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (= (bvadd sll_circular_get_data_at_~index (_ bv1 32)) |sll_circular_get_data_at_#in~index|))) (or (and .cse0 (and .cse1 .cse2)) (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) (_ bv4 32))))) (forall ((v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14) (_ bv0 32)))) (or (= v_main_~s~0.base_BEFORE_CALL_14 .cse5) (not (= (_ bv3 32) (select (select |#memory_int| .cse5) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14) (_ bv0 32)) (_ bv4 32)))))))) (and (forall ((sll_circular_create_~last~0.base (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse6 (select (select |#memory_$Pointer$.offset| v_prenex_6) (_ bv0 32)))) (or (not (= .cse6 (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~last~0.base) sll_circular_create_~last~0.offset))) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_prenex_6) (_ bv0 32))) (bvadd .cse6 (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))) (= sll_circular_create_~last~0.base v_prenex_6)))) (forall ((v_main_~s~0.base_BEFORE_CALL_20 (_ BitVec 32))) (let ((.cse7 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_20) (_ bv0 32))) (.cse8 (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_20) (_ bv0 32)))) (or (= v_main_~s~0.base_BEFORE_CALL_20 .cse7) (not (= (_ bv0 32) .cse8)) (not (= (bvadd (select (select |#memory_int| .cse7) (bvadd .cse8 (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))))) (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32))))) [2018-12-03 05:31:28,876 INFO L448 ceAbstractionStarter]: For program point L596-3(lines 596 599) no Hoare annotation was computed. [2018-12-03 05:31:28,876 INFO L448 ceAbstractionStarter]: For program point sll_circular_get_data_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-12-03 05:31:28,876 INFO L444 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (bvsgt (bvadd |sll_circular_create_#in~len| (_ bv4294967295 32)) (_ bv1 32)) (and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))) [2018-12-03 05:31:28,876 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-12-03 05:31:28,876 INFO L444 ceAbstractionStarter]: At program point L573(line 573) 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|) (= |sll_circular_create_#in~len| sll_circular_create_~len)) [2018-12-03 05:31:28,876 INFO L444 ceAbstractionStarter]: At program point L575-2(lines 575 580) the Hoare annotation is: (let ((.cse1 (bvadd |sll_circular_create_#in~len| (_ bv4294967295 32))) (.cse0 (= sll_circular_create_~head~0.offset (_ bv0 32))) (.cse2 (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base))) (or (and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) .cse0 (= .cse1 sll_circular_create_~len) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not .cse2)) (and (bvsgt .cse1 (_ bv1 32)) .cse0) (and .cse0 .cse2 (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1))))) [2018-12-03 05:31:28,876 INFO L448 ceAbstractionStarter]: For program point L573-1(line 573) no Hoare annotation was computed. [2018-12-03 05:31:28,876 INFO L448 ceAbstractionStarter]: For program point L575-3(lines 575 580) no Hoare annotation was computed. [2018-12-03 05:31:28,876 INFO L444 ceAbstractionStarter]: At program point sll_circular_createENTRY(lines 572 583) 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-12-03 05:31:28,876 INFO L448 ceAbstractionStarter]: For program point sll_circular_createFINAL(lines 572 583) no Hoare annotation was computed. [2018-12-03 05:31:28,876 INFO L448 ceAbstractionStarter]: For program point sll_circular_createEXIT(lines 572 583) no Hoare annotation was computed. [2018-12-03 05:31:28,876 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 05:31:28,876 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 05:31:28,877 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 05:31:28,877 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 05:31:28,877 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 609 628) no Hoare annotation was computed. [2018-12-03 05:31:28,877 INFO L448 ceAbstractionStarter]: For program point L624(line 624) no Hoare annotation was computed. [2018-12-03 05:31:28,877 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 609 628) no Hoare annotation was computed. [2018-12-03 05:31:28,877 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse0 (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select .cse6 main_~s~0.offset) (_ bv4 32))) (_ bv4294967295 32))) (.cse2 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (.cse4 (= (select .cse6 (_ bv0 32)) (_ bv0 32))) (.cse3 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and (= .cse0 (bvneg (bvneg main_~len~0))) .cse1 (= .cse2 main_~expected~0) (= main_~i~0 (_ bv0 32)) .cse3 .cse4 (= (bvadd main_~len~0 main_~i~0) main_~expected~0)) (let ((.cse5 (bvneg main_~i~0))) (and (= (_ bv1 32) (bvadd .cse5 .cse2)) .cse1 (= .cse0 (bvneg (bvneg (bvadd .cse2 .cse5 (_ bv1 32))))) (= (bvadd main_~expected~0 (_ bv4294967295 32)) (bvadd .cse5 .cse2 main_~i~0)) .cse4 .cse3 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-12-03 05:31:28,877 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 620 622) no Hoare annotation was computed. [2018-12-03 05:31:28,877 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (let ((.cse0 (= main_~s~0.offset (_ bv0 32))) (.cse1 (exists ((sll_circular_create_~last~0.base (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32))) (and (not (= sll_circular_create_~last~0.base main_~s~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_circular_create_~last~0.base) sll_circular_create_~last~0.offset) (_ bv0 32))))) (.cse2 (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base))) (.cse3 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse4 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32))) (.cse5 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))) (or (and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) .cse0 .cse1 .cse2 .cse3 .cse4 (= (bvadd (bvneg main_~len~0) main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= main_~len~0 main_~new_data~0) .cse0 .cse1 .cse2 (= main_~i~0 (_ bv0 32)) .cse3 .cse4 .cse5))) [2018-12-03 05:31:28,877 INFO L448 ceAbstractionStarter]: For program point L618-2(lines 618 623) no Hoare annotation was computed. [2018-12-03 05:31:28,877 INFO L448 ceAbstractionStarter]: For program point L616-1(lines 614 617) no Hoare annotation was computed. [2018-12-03 05:31:28,877 INFO L444 ceAbstractionStarter]: At program point L618-3(lines 618 623) the Hoare annotation is: (let ((.cse8 (bvsgt main_~i~0 (_ bv0 32))) (.cse6 (= main_~i~0 (_ bv0 32)))) (let ((.cse7 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse3 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))))) (.cse4 (let ((.cse9 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse8 .cse9) (and .cse9 .cse6)))) (.cse5 (= main_~s~0.offset (_ bv0 32)))) (let ((.cse0 (and .cse8 (and .cse3 .cse4 .cse5))) (.cse1 (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select .cse7 main_~s~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (bvneg (bvneg main_~len~0)))) (.cse2 (= (select .cse7 (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 (= (_ bv2 32) main_~i~0)) (and .cse1 .cse0 .cse2 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse2))))) [2018-12-03 05:31:28,877 INFO L444 ceAbstractionStarter]: At program point L618-4(lines 618 623) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-03 05:31:28,877 INFO L444 ceAbstractionStarter]: At program point L612(line 612) 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-12-03 05:31:28,878 INFO L444 ceAbstractionStarter]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse8 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse7 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse2 (exists ((sll_circular_create_~last~0.base (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32))) (and (not (= sll_circular_create_~last~0.base main_~s~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_circular_create_~last~0.base) sll_circular_create_~last~0.offset) (_ bv0 32))))) (.cse3 (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base))) (.cse6 (not (= (select .cse7 (_ bv0 32)) main_~s~0.base))) (.cse0 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse4 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse5 (= (select .cse8 (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse2 .cse3 (= main_~i~0 (_ bv0 32)) .cse4 .cse5 .cse6) (and (= (bvadd (select (select |#memory_int| (select .cse7 main_~s~0.offset)) (bvadd (select .cse8 main_~s~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (bvneg (bvneg main_~len~0))) .cse0 .cse1 .cse4 .cse5 (= (_ bv2 32) main_~i~0))))) [2018-12-03 05:31:28,878 INFO L448 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-12-03 05:31:28,878 INFO L448 ceAbstractionStarter]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2018-12-03 05:31:28,878 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 609 628) 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-12-03 05:31:28,878 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 626) no Hoare annotation was computed. [2018-12-03 05:31:28,878 INFO L444 ceAbstractionStarter]: At program point L621(lines 609 628) the Hoare annotation is: false [2018-12-03 05:31:28,878 INFO L451 ceAbstractionStarter]: At program point sll_circular_destroyENTRY(lines 584 594) the Hoare annotation is: true [2018-12-03 05:31:28,878 INFO L448 ceAbstractionStarter]: For program point sll_circular_destroyEXIT(lines 584 594) no Hoare annotation was computed. [2018-12-03 05:31:28,878 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 593) no Hoare annotation was computed. [2018-12-03 05:31:28,878 INFO L451 ceAbstractionStarter]: At program point L587-2(lines 587 591) the Hoare annotation is: true [2018-12-03 05:31:28,878 INFO L448 ceAbstractionStarter]: For program point L587-3(lines 587 591) no Hoare annotation was computed. [2018-12-03 05:31:28,878 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 584 594) no Hoare annotation was computed. [2018-12-03 05:31:28,878 INFO L448 ceAbstractionStarter]: For program point sll_circular_update_atEXIT(lines 602 608) no Hoare annotation was computed. [2018-12-03 05:31:28,878 INFO L444 ceAbstractionStarter]: At program point sll_circular_update_atENTRY(lines 602 608) 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 .cse0 (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) (_ bv4 32))))) (bvsgt (bvadd |sll_circular_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32))) (or (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)) .cse0))) [2018-12-03 05:31:28,879 INFO L448 ceAbstractionStarter]: For program point sll_circular_update_atFINAL(lines 602 608) no Hoare annotation was computed. [2018-12-03 05:31:28,879 INFO L444 ceAbstractionStarter]: At program point L603-2(lines 603 606) the Hoare annotation is: (let ((.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse3 (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data)) (.cse4 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse0 (and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= sll_circular_update_at_~index |sll_circular_update_at_#in~index|) .cse1 .cse2 .cse3 .cse4))) (and (or .cse0 (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32))) (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) (_ bv4 32))))) (bvsgt (bvadd |sll_circular_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) .cse0 (and (= (bvadd sll_circular_update_at_~index (_ bv1 32)) |sll_circular_update_at_#in~index|) .cse1 (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base)))))) [2018-12-03 05:31:28,879 INFO L448 ceAbstractionStarter]: For program point L603-3(lines 603 606) no Hoare annotation was computed. [2018-12-03 05:31:28,879 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-12-03 05:31:28,879 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-12-03 05:31:28,879 INFO L451 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-12-03 05:31:28,879 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-12-03 05:31:28,879 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-12-03 05:31:28,879 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-12-03 05:31:28,884 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 05:31:28,885 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 05:31:28,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 05:31:28,887 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 05:31:28,889 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 05:31:28,889 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 05:31:28,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 05:31:28,889 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 05:31:28,892 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-12-03 05:31:28,894 INFO L168 Benchmark]: Toolchain (without parser) took 120188.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -209.7 MB). Peak memory consumption was 360.6 MB. Max. memory is 11.5 GB. [2018-12-03 05:31:28,894 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:31:28,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2018-12-03 05:31:28,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 05:31:28,895 INFO L168 Benchmark]: Boogie Preprocessor took 26.33 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-03 05:31:28,895 INFO L168 Benchmark]: RCFGBuilder took 244.44 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-03 05:31:28,895 INFO L168 Benchmark]: TraceAbstraction took 119614.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -64.3 MB). Peak memory consumption was 365.0 MB. Max. memory is 11.5 GB. [2018-12-03 05:31:28,896 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 277.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.33 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 244.44 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: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119614.66 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -64.3 MB). Peak memory consumption was 365.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 626]: 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 - InvariantResult [Line: 575]: Loop Invariant [2018-12-03 05:31:28,898 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 05:31:28,899 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 05:31:28,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 05:31:28,899 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 05:31:28,899 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-03 05:31:28,899 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-03 05:31:28,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-03 05:31:28,900 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((#memory_$Pointer$[head][head] == last && head == 0bv32) && ~bvadd64(\old(len), 4294967295bv32) == len) && 0bv32 == #memory_$Pointer$[head][head]) && !(head == last)) || (~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 1bv32) && head == 0bv32)) || (((head == 0bv32 && head == last) && \old(len) == len) && ~bvadd64(\valid[head], 1bv1) == 0bv1) - 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...