./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5ff4911e3fc4b31379d272e7a417bab5f7414e68 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5ff4911e3fc4b31379d272e7a417bab5f7414e68 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:35:45,929 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:35:45,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:35:45,938 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:35:45,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:35:45,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:35:45,940 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:35:45,942 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:35:45,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:35:45,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:35:45,944 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:35:45,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:35:45,945 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:35:45,946 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:35:45,946 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:35:45,947 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:35:45,947 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:35:45,949 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:35:45,950 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:35:45,951 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:35:45,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:35:45,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:35:45,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:35:45,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:35:45,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:35:45,956 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:35:45,957 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:35:45,958 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:35:45,959 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:35:45,959 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:35:45,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:35:45,960 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:35:45,960 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:35:45,960 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:35:45,961 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:35:45,961 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:35:45,962 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-28 13:35:45,969 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:35:45,969 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:35:45,970 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:35:45,970 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:35:45,971 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:35:45,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:35:45,971 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:35:45,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:35:45,971 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:35:45,971 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:35:45,972 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:35:45,972 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:35:45,972 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:35:45,972 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:35:45,972 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:35:45,972 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:35:45,972 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:35:45,973 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:35:45,973 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:35:45,973 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:35:45,973 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:35:45,973 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:35:45,973 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:35:45,973 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:35:45,976 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:35:45,976 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:35:45,976 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:35:45,976 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-28 13:35:45,976 INFO L133 SettingsManager]: * To the following directory=dump/ 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_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ff4911e3fc4b31379d272e7a417bab5f7414e68 [2018-11-28 13:35:46,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:35:46,015 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:35:46,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:35:46,019 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:35:46,019 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:35:46,019 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i [2018-11-28 13:35:46,070 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data/ab64dfbf3/0a61a0254e1549588d41165e5b0caa2d/FLAGb1bc3daf5 [2018-11-28 13:35:46,558 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:35:46,558 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i [2018-11-28 13:35:46,578 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data/ab64dfbf3/0a61a0254e1549588d41165e5b0caa2d/FLAGb1bc3daf5 [2018-11-28 13:35:46,829 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data/ab64dfbf3/0a61a0254e1549588d41165e5b0caa2d [2018-11-28 13:35:46,832 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:35:46,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:35:46,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:35:46,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:35:46,837 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:35:46,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:35:46" (1/1) ... [2018-11-28 13:35:46,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d172fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:46, skipping insertion in model container [2018-11-28 13:35:46,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:35:46" (1/1) ... [2018-11-28 13:35:46,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:35:46,914 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:35:47,653 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:35:47,675 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:35:47,840 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:35:47,873 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:35:47,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47 WrapperNode [2018-11-28 13:35:47,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:35:47,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:35:47,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:35:47,875 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:35:47,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... [2018-11-28 13:35:47,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... [2018-11-28 13:35:47,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:35:47,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:35:47,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:35:47,909 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:35:47,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... [2018-11-28 13:35:47,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... [2018-11-28 13:35:47,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... [2018-11-28 13:35:47,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... [2018-11-28 13:35:47,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... [2018-11-28 13:35:47,950 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... [2018-11-28 13:35:47,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... [2018-11-28 13:35:47,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:35:47,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:35:47,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:35:47,960 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:35:47,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:35:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-11-28 13:35:48,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-11-28 13:35:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:35:48,015 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:35:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-11-28 13:35:48,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-11-28 13:35:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:35:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-28 13:35:48,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-28 13:35:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-28 13:35:48,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-28 13:35:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:35:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-28 13:35:48,017 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-28 13:35:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:35:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-11-28 13:35:48,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-11-28 13:35:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-11-28 13:35:48,017 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-11-28 13:35:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-11-28 13:35:48,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-11-28 13:35:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-11-28 13:35:48,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-11-28 13:35:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:35:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 13:35:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-11-28 13:35:48,018 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-11-28 13:35:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-28 13:35:48,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-28 13:35:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-11-28 13:35:48,018 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-11-28 13:35:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-11-28 13:35:48,019 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-11-28 13:35:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-28 13:35:48,019 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-28 13:35:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-11-28 13:35:48,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-11-28 13:35:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 13:35:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:35:48,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:35:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-11-28 13:35:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-11-28 13:35:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-28 13:35:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-28 13:35:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-11-28 13:35:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-11-28 13:35:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:35:48,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:35:48,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-11-28 13:35:48,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-11-28 13:35:48,671 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:35:48,671 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 13:35:48,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:48 BoogieIcfgContainer [2018-11-28 13:35:48,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:35:48,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:35:48,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:35:48,675 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:35:48,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:35:46" (1/3) ... [2018-11-28 13:35:48,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3c62cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:35:48, skipping insertion in model container [2018-11-28 13:35:48,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:35:47" (2/3) ... [2018-11-28 13:35:48,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3c62cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:35:48, skipping insertion in model container [2018-11-28 13:35:48,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:35:48" (3/3) ... [2018-11-28 13:35:48,678 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i [2018-11-28 13:35:48,688 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:35:48,695 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:35:48,710 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:35:48,738 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:35:48,739 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:35:48,739 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:35:48,739 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:35:48,739 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:35:48,739 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:35:48,739 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:35:48,740 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:35:48,740 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:35:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-11-28 13:35:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 13:35:48,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:48,767 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:48,768 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:48,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:48,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1050314844, now seen corresponding path program 1 times [2018-11-28 13:35:48,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:48,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:48,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:48,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:35:49,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:49,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:49,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:49,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:49,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:49,083 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-11-28 13:35:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:49,163 INFO L93 Difference]: Finished difference Result 307 states and 392 transitions. [2018-11-28 13:35:49,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:49,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 13:35:49,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:49,175 INFO L225 Difference]: With dead ends: 307 [2018-11-28 13:35:49,176 INFO L226 Difference]: Without dead ends: 190 [2018-11-28 13:35:49,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:49,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-11-28 13:35:49,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-11-28 13:35:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-28 13:35:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2018-11-28 13:35:49,230 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 69 [2018-11-28 13:35:49,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:49,231 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2018-11-28 13:35:49,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2018-11-28 13:35:49,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 13:35:49,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:49,235 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:49,235 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:49,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:49,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1084624468, now seen corresponding path program 1 times [2018-11-28 13:35:49,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:49,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:49,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:49,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:49,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:35:49,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:49,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:49,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:49,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:49,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:49,355 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand 3 states. [2018-11-28 13:35:49,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:49,387 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2018-11-28 13:35:49,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:49,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-28 13:35:49,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:49,389 INFO L225 Difference]: With dead ends: 197 [2018-11-28 13:35:49,389 INFO L226 Difference]: Without dead ends: 192 [2018-11-28 13:35:49,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-28 13:35:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2018-11-28 13:35:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-28 13:35:49,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 226 transitions. [2018-11-28 13:35:49,403 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 226 transitions. Word has length 74 [2018-11-28 13:35:49,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:49,404 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 226 transitions. [2018-11-28 13:35:49,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2018-11-28 13:35:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 13:35:49,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:49,405 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:49,405 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:49,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1141882770, now seen corresponding path program 1 times [2018-11-28 13:35:49,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:49,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:49,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:35:49,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:49,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:49,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:49,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:49,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:49,531 INFO L87 Difference]: Start difference. First operand 187 states and 226 transitions. Second operand 3 states. [2018-11-28 13:35:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:49,585 INFO L93 Difference]: Finished difference Result 490 states and 613 transitions. [2018-11-28 13:35:49,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:49,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-28 13:35:49,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:49,590 INFO L225 Difference]: With dead ends: 490 [2018-11-28 13:35:49,591 INFO L226 Difference]: Without dead ends: 327 [2018-11-28 13:35:49,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:49,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-28 13:35:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2018-11-28 13:35:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-11-28 13:35:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 401 transitions. [2018-11-28 13:35:49,619 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 401 transitions. Word has length 74 [2018-11-28 13:35:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:49,620 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 401 transitions. [2018-11-28 13:35:49,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 401 transitions. [2018-11-28 13:35:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 13:35:49,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:49,622 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:49,622 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:49,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash 435481164, now seen corresponding path program 1 times [2018-11-28 13:35:49,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:49,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:49,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:49,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:49,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:49,722 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:35:49,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:49,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:49,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:49,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:49,724 INFO L87 Difference]: Start difference. First operand 323 states and 401 transitions. Second operand 3 states. [2018-11-28 13:35:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:49,775 INFO L93 Difference]: Finished difference Result 701 states and 881 transitions. [2018-11-28 13:35:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:49,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-11-28 13:35:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:49,778 INFO L225 Difference]: With dead ends: 701 [2018-11-28 13:35:49,778 INFO L226 Difference]: Without dead ends: 412 [2018-11-28 13:35:49,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-11-28 13:35:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 399. [2018-11-28 13:35:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-11-28 13:35:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 501 transitions. [2018-11-28 13:35:49,801 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 501 transitions. Word has length 88 [2018-11-28 13:35:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:49,802 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 501 transitions. [2018-11-28 13:35:49,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 501 transitions. [2018-11-28 13:35:49,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-28 13:35:49,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:49,804 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:49,804 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:49,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:49,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2032288072, now seen corresponding path program 1 times [2018-11-28 13:35:49,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:49,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:49,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:49,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:49,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:49,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:35:49,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:49,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:35:49,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:35:49,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:35:49,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:49,956 INFO L87 Difference]: Start difference. First operand 399 states and 501 transitions. Second operand 7 states. [2018-11-28 13:35:50,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:50,040 INFO L93 Difference]: Finished difference Result 800 states and 1013 transitions. [2018-11-28 13:35:50,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:35:50,041 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-11-28 13:35:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:50,044 INFO L225 Difference]: With dead ends: 800 [2018-11-28 13:35:50,044 INFO L226 Difference]: Without dead ends: 435 [2018-11-28 13:35:50,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:50,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-11-28 13:35:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 429. [2018-11-28 13:35:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-11-28 13:35:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 535 transitions. [2018-11-28 13:35:50,069 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 535 transitions. Word has length 107 [2018-11-28 13:35:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:50,070 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 535 transitions. [2018-11-28 13:35:50,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:35:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 535 transitions. [2018-11-28 13:35:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-28 13:35:50,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:50,072 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:50,072 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:50,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:50,073 INFO L82 PathProgramCache]: Analyzing trace with hash 982815546, now seen corresponding path program 1 times [2018-11-28 13:35:50,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:50,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:35:50,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:50,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:50,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:50,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:50,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:50,186 INFO L87 Difference]: Start difference. First operand 429 states and 535 transitions. Second operand 3 states. [2018-11-28 13:35:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:50,215 INFO L93 Difference]: Finished difference Result 799 states and 1014 transitions. [2018-11-28 13:35:50,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:50,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-11-28 13:35:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:50,217 INFO L225 Difference]: With dead ends: 799 [2018-11-28 13:35:50,217 INFO L226 Difference]: Without dead ends: 404 [2018-11-28 13:35:50,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-11-28 13:35:50,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2018-11-28 13:35:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-28 13:35:50,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 488 transitions. [2018-11-28 13:35:50,234 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 488 transitions. Word has length 107 [2018-11-28 13:35:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:50,234 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 488 transitions. [2018-11-28 13:35:50,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:50,235 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 488 transitions. [2018-11-28 13:35:50,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-28 13:35:50,236 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:50,236 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:50,236 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:50,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:50,236 INFO L82 PathProgramCache]: Analyzing trace with hash 508152540, now seen corresponding path program 1 times [2018-11-28 13:35:50,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:50,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:50,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:50,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:50,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:35:50,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:50,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:35:50,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:35:50,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:35:50,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:50,439 INFO L87 Difference]: Start difference. First operand 392 states and 488 transitions. Second operand 7 states. [2018-11-28 13:35:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:51,030 INFO L93 Difference]: Finished difference Result 637 states and 788 transitions. [2018-11-28 13:35:51,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:35:51,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-11-28 13:35:51,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:51,035 INFO L225 Difference]: With dead ends: 637 [2018-11-28 13:35:51,035 INFO L226 Difference]: Without dead ends: 634 [2018-11-28 13:35:51,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:35:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-11-28 13:35:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 599. [2018-11-28 13:35:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-11-28 13:35:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 751 transitions. [2018-11-28 13:35:51,063 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 751 transitions. Word has length 113 [2018-11-28 13:35:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:51,064 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 751 transitions. [2018-11-28 13:35:51,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:35:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 751 transitions. [2018-11-28 13:35:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-28 13:35:51,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:51,066 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:51,066 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:51,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:51,066 INFO L82 PathProgramCache]: Analyzing trace with hash -812446572, now seen corresponding path program 1 times [2018-11-28 13:35:51,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:51,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:51,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:51,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:35:51,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:51,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:35:51,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:35:51,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:35:51,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:51,140 INFO L87 Difference]: Start difference. First operand 599 states and 751 transitions. Second operand 3 states. [2018-11-28 13:35:51,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:51,166 INFO L93 Difference]: Finished difference Result 1033 states and 1296 transitions. [2018-11-28 13:35:51,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:35:51,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-11-28 13:35:51,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:51,170 INFO L225 Difference]: With dead ends: 1033 [2018-11-28 13:35:51,170 INFO L226 Difference]: Without dead ends: 611 [2018-11-28 13:35:51,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:35:51,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-28 13:35:51,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 599. [2018-11-28 13:35:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-11-28 13:35:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 747 transitions. [2018-11-28 13:35:51,198 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 747 transitions. Word has length 122 [2018-11-28 13:35:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:51,198 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 747 transitions. [2018-11-28 13:35:51,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:35:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 747 transitions. [2018-11-28 13:35:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-28 13:35:51,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:51,200 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:51,200 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:51,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:51,200 INFO L82 PathProgramCache]: Analyzing trace with hash -946460078, now seen corresponding path program 1 times [2018-11-28 13:35:51,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:51,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:51,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:51,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:51,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:51,307 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:35:51,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:51,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:35:51,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:35:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:35:51,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:51,309 INFO L87 Difference]: Start difference. First operand 599 states and 747 transitions. Second operand 7 states. [2018-11-28 13:35:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:51,356 INFO L93 Difference]: Finished difference Result 1025 states and 1278 transitions. [2018-11-28 13:35:51,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:35:51,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-11-28 13:35:51,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:51,359 INFO L225 Difference]: With dead ends: 1025 [2018-11-28 13:35:51,360 INFO L226 Difference]: Without dead ends: 603 [2018-11-28 13:35:51,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:35:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-11-28 13:35:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2018-11-28 13:35:51,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-11-28 13:35:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 741 transitions. [2018-11-28 13:35:51,387 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 741 transitions. Word has length 122 [2018-11-28 13:35:51,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:51,387 INFO L480 AbstractCegarLoop]: Abstraction has 597 states and 741 transitions. [2018-11-28 13:35:51,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:35:51,387 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 741 transitions. [2018-11-28 13:35:51,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-28 13:35:51,389 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:51,389 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:51,390 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:51,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1405487414, now seen corresponding path program 1 times [2018-11-28 13:35:51,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:51,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:51,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:51,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:35:51,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:35:51,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:35:51,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:35:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:35:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:35:51,507 INFO L87 Difference]: Start difference. First operand 597 states and 741 transitions. Second operand 6 states. [2018-11-28 13:35:51,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:35:51,584 INFO L93 Difference]: Finished difference Result 1178 states and 1466 transitions. [2018-11-28 13:35:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:35:51,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-11-28 13:35:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:35:51,588 INFO L225 Difference]: With dead ends: 1178 [2018-11-28 13:35:51,588 INFO L226 Difference]: Without dead ends: 598 [2018-11-28 13:35:51,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:35:51,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-11-28 13:35:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2018-11-28 13:35:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-11-28 13:35:51,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 742 transitions. [2018-11-28 13:35:51,606 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 742 transitions. Word has length 137 [2018-11-28 13:35:51,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:35:51,606 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 742 transitions. [2018-11-28 13:35:51,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:35:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 742 transitions. [2018-11-28 13:35:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-28 13:35:51,608 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:35:51,608 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:35:51,608 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:35:51,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:35:51,608 INFO L82 PathProgramCache]: Analyzing trace with hash 78385292, now seen corresponding path program 1 times [2018-11-28 13:35:51,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:35:51,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:35:51,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:51,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:51,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:35:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-28 13:35:51,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:35:51,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:35:51,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:35:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:35:51,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:35:51,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 152 [2018-11-28 13:35:52,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,062 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 2 case distinctions, treesize of input 149 treesize of output 147 [2018-11-28 13:35:52,473 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-11-28 13:35:52,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,482 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 130 [2018-11-28 13:35:52,604 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-11-28 13:35:52,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 124 [2018-11-28 13:35:52,795 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-11-28 13:35:52,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 123 [2018-11-28 13:35:52,984 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-11-28 13:35:52,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:52,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,003 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,007 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 133 [2018-11-28 13:35:53,151 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-11-28 13:35:53,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,158 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 146 [2018-11-28 13:35:53,302 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-11-28 13:35:53,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,309 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,313 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,320 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-11-28 13:35:53,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-11-28 13:35:53,333 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:53,413 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:53,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:53,546 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:53,618 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:53,684 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:53,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:53,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:53,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 140 [2018-11-28 13:35:54,266 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-11-28 13:35:54,284 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,292 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,294 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,301 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,304 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 138 [2018-11-28 13:35:54,687 WARN L180 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2018-11-28 13:35:54,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,699 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,706 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 127 [2018-11-28 13:35:54,824 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-11-28 13:35:54,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,837 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,840 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,845 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 133 [2018-11-28 13:35:54,976 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-11-28 13:35:54,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,983 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,985 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,989 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,993 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,996 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:54,998 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 146 [2018-11-28 13:35:55,112 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-11-28 13:35:55,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,119 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,128 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,130 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-11-28 13:35:55,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-11-28 13:35:55,152 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:55,223 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:55,289 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:55,410 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:55,470 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:55,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,581 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,592 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:55,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 141 [2018-11-28 13:35:56,102 WARN L180 SmtUtils]: Spent 466.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-11-28 13:35:56,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,109 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,115 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,117 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,125 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 137 [2018-11-28 13:35:56,261 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-11-28 13:35:56,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,278 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,286 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,291 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 146 [2018-11-28 13:35:56,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,394 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-11-28 13:35:56,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-11-28 13:35:56,409 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:56,462 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:56,514 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:56,573 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:56,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,697 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,705 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:56,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 155 [2018-11-28 13:35:57,022 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-11-28 13:35:57,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,026 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,027 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,028 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,029 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,030 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,031 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,032 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 158 [2018-11-28 13:35:57,149 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-11-28 13:35:57,154 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,161 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,165 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,166 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,167 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-11-28 13:35:57,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-11-28 13:35:57,182 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:57,234 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:57,293 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:57,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,450 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,452 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,453 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,457 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 172 [2018-11-28 13:35:57,853 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2018-11-28 13:35:57,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,864 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:57,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 35 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 200 [2018-11-28 13:35:57,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 186 [2018-11-28 13:35:57,893 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:58,092 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,095 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,096 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,098 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,099 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,100 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,103 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,105 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 196 [2018-11-28 13:35:58,113 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-28 13:35:58,383 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:35:58,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,659 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,660 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,661 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,663 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,672 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,673 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:35:58,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 182 [2018-11-28 13:35:58,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-11-28 13:35:58,682 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-28 13:35:58,748 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:35:59,028 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-28 13:35:59,398 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-28 13:35:59,798 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-28 13:36:00,253 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-28 13:36:00,779 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,785 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,787 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 124 [2018-11-28 13:36:00,894 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-11-28 13:36:00,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,907 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 123 [2018-11-28 13:36:00,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,975 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,976 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,977 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:00,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 133 [2018-11-28 13:36:01,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,056 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,059 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,061 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,062 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 146 [2018-11-28 13:36:01,165 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-11-28 13:36:01,168 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,169 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,170 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,171 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,172 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,173 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,174 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,176 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,178 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,179 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:01,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-11-28 13:36:01,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-11-28 13:36:01,189 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:01,255 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:01,319 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:01,381 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:01,439 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:01,496 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:02,004 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-11-28 13:36:02,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-28 13:36:03,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-28 13:36:03,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 56 dim-0 vars, and 9 xjuncts. [2018-11-28 13:36:03,816 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 8 variables, input treesize:188, output treesize:1539 [2018-11-28 13:36:14,479 WARN L180 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 707 DAG size of output: 257 [2018-11-28 13:36:22,396 WARN L180 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 257 [2018-11-28 13:36:22,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,439 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 257 [2018-11-28 13:36:22,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:22,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,760 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,761 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,762 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:22,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 233 [2018-11-28 13:36:22,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:23,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:23,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:23,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:23,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:23,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:23,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:23,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:23,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:23,049 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:36:23,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 172 [2018-11-28 13:36:23,050 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:23,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-28 13:36:23,289 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 23 variables, input treesize:543, output treesize:91 [2018-11-28 13:36:23,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 13:36:23,349 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 3 [2018-11-28 13:36:23,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:23,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:23,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-28 13:36:23,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 5 treesize of output 3 [2018-11-28 13:36:23,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:23,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:23,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:23,381 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-11-28 13:36:36,217 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 21 treesize of output 22 [2018-11-28 13:36:36,219 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-11-28 13:36:36,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:36,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:36,244 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 21 treesize of output 22 [2018-11-28 13:36:36,246 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-11-28 13:36:36,247 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:36,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:36,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:36,263 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:51, output treesize:43 [2018-11-28 13:36:38,330 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 17 treesize of output 17 [2018-11-28 13:36:38,332 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 3 [2018-11-28 13:36:38,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:38,338 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 7 treesize of output 1 [2018-11-28 13:36:38,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:38,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:38,350 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 17 treesize of output 17 [2018-11-28 13:36:38,352 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 3 [2018-11-28 13:36:38,352 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:38,357 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 7 treesize of output 1 [2018-11-28 13:36:38,357 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:38,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:38,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:38,364 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:46, output treesize:10 [2018-11-28 13:36:41,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:36:41,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 13:36:41,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:41,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:42,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:42,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-11-28 13:36:45,835 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 34 treesize of output 65 [2018-11-28 13:36:45,842 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:36:45,842 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 0 case distinctions, treesize of input 40 treesize of output 52 [2018-11-28 13:36:45,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:45,902 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 31 treesize of output 30 [2018-11-28 13:36:45,903 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:45,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:45,976 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 28 treesize of output 59 [2018-11-28 13:36:45,990 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-28 13:36:45,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:46,050 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 25 treesize of output 24 [2018-11-28 13:36:46,050 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:46,077 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:46,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:46,093 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:78, output treesize:70 [2018-11-28 13:36:51,481 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 22 [2018-11-28 13:36:51,483 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 13 [2018-11-28 13:36:51,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:36:51,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:36:51,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-28 13:36:51,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:59 [2018-11-28 13:37:03,212 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 3 refuted. 7 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 13:37:03,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:37:03,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 23] total 28 [2018-11-28 13:37:03,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-28 13:37:03,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-28 13:37:03,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=629, Unknown=43, NotChecked=0, Total=756 [2018-11-28 13:37:03,231 INFO L87 Difference]: Start difference. First operand 598 states and 742 transitions. Second operand 28 states. [2018-11-28 13:37:17,361 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-28 13:37:17,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 13:37:17,362 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:191) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2018-11-28 13:37:17,364 INFO L168 Benchmark]: Toolchain (without parser) took 90532.36 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 608.2 MB). Free memory was 944.1 MB in the beginning and 1.2 GB in the end (delta: -217.6 MB). Peak memory consumption was 390.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:17,365 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:37:17,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1040.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:17,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.17 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:17,366 INFO L168 Benchmark]: Boogie Preprocessor took 50.56 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:17,366 INFO L168 Benchmark]: RCFGBuilder took 712.11 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:17,366 INFO L168 Benchmark]: TraceAbstraction took 88691.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 428.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.3 MB). Peak memory consumption was 317.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:17,367 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1040.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -171.1 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.17 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.56 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 712.11 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88691.81 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 428.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -111.3 MB). Peak memory consumption was 317.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:37:18,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:37:18,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:37:18,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:37:18,566 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:37:18,567 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:37:18,568 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:37:18,569 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:37:18,570 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:37:18,570 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:37:18,571 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:37:18,571 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:37:18,572 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:37:18,573 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:37:18,573 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:37:18,575 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:37:18,575 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:37:18,576 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:37:18,578 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:37:18,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:37:18,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:37:18,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:37:18,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:37:18,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:37:18,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:37:18,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:37:18,584 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:37:18,585 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:37:18,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:37:18,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:37:18,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:37:18,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:37:18,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:37:18,588 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:37:18,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:37:18,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:37:18,589 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2018-11-28 13:37:18,600 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:37:18,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:37:18,601 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:37:18,601 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:37:18,601 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:37:18,602 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:37:18,602 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:37:18,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:37:18,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:37:18,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:37:18,602 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:37:18,602 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:37:18,603 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 13:37:18,603 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 13:37:18,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:37:18,603 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:37:18,603 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:37:18,603 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:37:18,603 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:37:18,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:37:18,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:37:18,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:37:18,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:37:18,604 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:37:18,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:37:18,604 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 13:37:18,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:37:18,605 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 13:37:18,605 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 13:37:18,605 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-28 13:37:18,605 INFO L133 SettingsManager]: * To the following directory=dump/ 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_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ff4911e3fc4b31379d272e7a417bab5f7414e68 [2018-11-28 13:37:18,633 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:37:18,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:37:18,644 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:37:18,645 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:37:18,646 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:37:18,646 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i [2018-11-28 13:37:18,689 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data/554f60f4b/458d341612284cc08c46402df648fcfd/FLAGe0eb2c4dd [2018-11-28 13:37:19,181 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:37:19,182 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i [2018-11-28 13:37:19,203 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data/554f60f4b/458d341612284cc08c46402df648fcfd/FLAGe0eb2c4dd [2018-11-28 13:37:19,462 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/data/554f60f4b/458d341612284cc08c46402df648fcfd [2018-11-28 13:37:19,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:37:19,467 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:37:19,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:37:19,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:37:19,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:37:19,476 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:37:19" (1/1) ... [2018-11-28 13:37:19,480 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6658c4d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:19, skipping insertion in model container [2018-11-28 13:37:19,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:37:19" (1/1) ... [2018-11-28 13:37:19,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:37:19,552 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:37:20,168 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:37:20,190 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:37:20,315 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:37:20,345 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:37:20,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20 WrapperNode [2018-11-28 13:37:20,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:37:20,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:37:20,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:37:20,347 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:37:20,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... [2018-11-28 13:37:20,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... [2018-11-28 13:37:20,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:37:20,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:37:20,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:37:20,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:37:20,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... [2018-11-28 13:37:20,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... [2018-11-28 13:37:20,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... [2018-11-28 13:37:20,388 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... [2018-11-28 13:37:20,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... [2018-11-28 13:37:20,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... [2018-11-28 13:37:20,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... [2018-11-28 13:37:20,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:37:20,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:37:20,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:37:20,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:37:20,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:37:20,464 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-11-28 13:37:20,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-11-28 13:37:20,464 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:37:20,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-11-28 13:37:20,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-11-28 13:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-28 13:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-28 13:37:20,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-28 13:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-28 13:37:20,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-11-28 13:37:20,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-28 13:37:20,466 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-28 13:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-11-28 13:37:20,466 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-11-28 13:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-11-28 13:37:20,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-11-28 13:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-11-28 13:37:20,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-11-28 13:37:20,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-11-28 13:37:20,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-11-28 13:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-28 13:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2018-11-28 13:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-28 13:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-11-28 13:37:20,467 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-11-28 13:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-28 13:37:20,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-28 13:37:20,467 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-11-28 13:37:20,467 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-11-28 13:37:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-11-28 13:37:20,468 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-11-28 13:37:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-28 13:37:20,468 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-28 13:37:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-11-28 13:37:20,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-11-28 13:37:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:37:20,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:37:20,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-11-28 13:37:20,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-11-28 13:37:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-28 13:37:20,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-28 13:37:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-11-28 13:37:20,469 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-11-28 13:37:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:37:20,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:37:20,469 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-11-28 13:37:20,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-11-28 13:37:21,034 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:37:21,034 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 13:37:21,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:37:21 BoogieIcfgContainer [2018-11-28 13:37:21,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:37:21,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:37:21,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:37:21,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:37:21,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:37:19" (1/3) ... [2018-11-28 13:37:21,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79eca769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:37:21, skipping insertion in model container [2018-11-28 13:37:21,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:37:20" (2/3) ... [2018-11-28 13:37:21,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79eca769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:37:21, skipping insertion in model container [2018-11-28 13:37:21,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:37:21" (3/3) ... [2018-11-28 13:37:21,040 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i [2018-11-28 13:37:21,046 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:37:21,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:37:21,062 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:37:21,082 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:37:21,083 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:37:21,083 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:37:21,083 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:37:21,083 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:37:21,083 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:37:21,083 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:37:21,084 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:37:21,084 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:37:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-11-28 13:37:21,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 13:37:21,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:21,108 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:21,110 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:21,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:21,114 INFO L82 PathProgramCache]: Analyzing trace with hash 250893536, now seen corresponding path program 1 times [2018-11-28 13:37:21,119 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:21,120 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/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-11-28 13:37:21,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:21,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:37:21,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:37:21,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:21,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:37:21,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:37:21,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:37:21,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:37:21,407 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-11-28 13:37:21,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:21,476 INFO L93 Difference]: Finished difference Result 327 states and 419 transitions. [2018-11-28 13:37:21,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:37:21,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 13:37:21,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:21,487 INFO L225 Difference]: With dead ends: 327 [2018-11-28 13:37:21,487 INFO L226 Difference]: Without dead ends: 200 [2018-11-28 13:37:21,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:37:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-28 13:37:21,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-11-28 13:37:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-28 13:37:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 241 transitions. [2018-11-28 13:37:21,536 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 241 transitions. Word has length 69 [2018-11-28 13:37:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:21,537 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 241 transitions. [2018-11-28 13:37:21,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:37:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 241 transitions. [2018-11-28 13:37:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-28 13:37:21,541 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:21,541 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:21,541 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:21,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash 469035080, now seen corresponding path program 1 times [2018-11-28 13:37:21,543 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:21,543 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/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-11-28 13:37:21,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:21,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-28 13:37:21,790 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:37:21,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:21,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:37:21,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:37:21,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:37:21,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:37:21,795 INFO L87 Difference]: Start difference. First operand 197 states and 241 transitions. Second operand 3 states. [2018-11-28 13:37:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:21,842 INFO L93 Difference]: Finished difference Result 423 states and 525 transitions. [2018-11-28 13:37:21,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:37:21,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-11-28 13:37:21,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:21,845 INFO L225 Difference]: With dead ends: 423 [2018-11-28 13:37:21,846 INFO L226 Difference]: Without dead ends: 260 [2018-11-28 13:37:21,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:37:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-28 13:37:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 247. [2018-11-28 13:37:21,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-28 13:37:21,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2018-11-28 13:37:21,870 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 88 [2018-11-28 13:37:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:21,871 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2018-11-28 13:37:21,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:37:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2018-11-28 13:37:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-28 13:37:21,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:21,874 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:21,874 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:21,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:21,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1305361854, now seen corresponding path program 1 times [2018-11-28 13:37:21,875 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:21,875 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/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-11-28 13:37:21,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:22,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:22,182 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 35 treesize of output 31 [2018-11-28 13:37:22,188 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 31 treesize of output 15 [2018-11-28 13:37:22,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:22,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:22,208 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 27 treesize of output 23 [2018-11-28 13:37:22,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, 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 7 [2018-11-28 13:37:22,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:37:22,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:22,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:37:22,218 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:7 [2018-11-28 13:37:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 13:37:22,256 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:37:22,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:22,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:37:22,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:37:22,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:37:22,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:37:22,259 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand 5 states. [2018-11-28 13:37:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:22,428 INFO L93 Difference]: Finished difference Result 470 states and 592 transitions. [2018-11-28 13:37:22,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:37:22,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-28 13:37:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:22,432 INFO L225 Difference]: With dead ends: 470 [2018-11-28 13:37:22,432 INFO L226 Difference]: Without dead ends: 257 [2018-11-28 13:37:22,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:37:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-28 13:37:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-11-28 13:37:22,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-28 13:37:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 314 transitions. [2018-11-28 13:37:22,454 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 314 transitions. Word has length 107 [2018-11-28 13:37:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:22,455 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 314 transitions. [2018-11-28 13:37:22,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:37:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 314 transitions. [2018-11-28 13:37:22,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-28 13:37:22,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:22,457 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:22,458 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:22,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:22,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1603402048, now seen corresponding path program 1 times [2018-11-28 13:37:22,459 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:22,459 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:37:22,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:22,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 13:37:22,950 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:37:22,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:22,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:37:22,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:37:22,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:37:22,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:37:22,956 INFO L87 Difference]: Start difference. First operand 254 states and 314 transitions. Second operand 6 states. [2018-11-28 13:37:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:23,046 INFO L93 Difference]: Finished difference Result 492 states and 612 transitions. [2018-11-28 13:37:23,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:37:23,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-11-28 13:37:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:23,048 INFO L225 Difference]: With dead ends: 492 [2018-11-28 13:37:23,048 INFO L226 Difference]: Without dead ends: 255 [2018-11-28 13:37:23,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:37:23,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-11-28 13:37:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-11-28 13:37:23,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-28 13:37:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 315 transitions. [2018-11-28 13:37:23,063 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 315 transitions. Word has length 107 [2018-11-28 13:37:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:23,063 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 315 transitions. [2018-11-28 13:37:23,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:37:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 315 transitions. [2018-11-28 13:37:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-28 13:37:23,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:23,064 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:23,065 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:23,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:23,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1129967362, now seen corresponding path program 1 times [2018-11-28 13:37:23,065 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:23,065 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/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-11-28 13:37:23,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:23,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:23,515 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 13:37:23,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:37:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 13:37:23,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:37:23,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-28 13:37:23,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:37:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:37:23,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:37:23,680 INFO L87 Difference]: Start difference. First operand 255 states and 315 transitions. Second operand 11 states. [2018-11-28 13:37:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:23,846 INFO L93 Difference]: Finished difference Result 494 states and 614 transitions. [2018-11-28 13:37:23,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:37:23,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 109 [2018-11-28 13:37:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:23,847 INFO L225 Difference]: With dead ends: 494 [2018-11-28 13:37:23,848 INFO L226 Difference]: Without dead ends: 256 [2018-11-28 13:37:23,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:37:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-28 13:37:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-11-28 13:37:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-28 13:37:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 316 transitions. [2018-11-28 13:37:23,861 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 316 transitions. Word has length 109 [2018-11-28 13:37:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:23,861 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 316 transitions. [2018-11-28 13:37:23,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:37:23,861 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 316 transitions. [2018-11-28 13:37:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 13:37:23,862 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:23,862 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:23,863 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:23,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash -369324864, now seen corresponding path program 2 times [2018-11-28 13:37:23,863 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:23,863 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:37:23,886 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 13:37:24,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 13:37:24,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:37:24,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-28 13:37:24,247 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:37:24,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:24,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:37:24,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:37:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:37:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:37:24,252 INFO L87 Difference]: Start difference. First operand 256 states and 316 transitions. Second operand 7 states. [2018-11-28 13:37:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:24,279 INFO L93 Difference]: Finished difference Result 494 states and 618 transitions. [2018-11-28 13:37:24,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:37:24,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-28 13:37:24,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:24,281 INFO L225 Difference]: With dead ends: 494 [2018-11-28 13:37:24,282 INFO L226 Difference]: Without dead ends: 274 [2018-11-28 13:37:24,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:37:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-28 13:37:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2018-11-28 13:37:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-11-28 13:37:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 322 transitions. [2018-11-28 13:37:24,294 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 322 transitions. Word has length 111 [2018-11-28 13:37:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:24,295 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 322 transitions. [2018-11-28 13:37:24,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:37:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 322 transitions. [2018-11-28 13:37:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-28 13:37:24,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:24,296 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:24,296 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:24,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:24,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1649188542, now seen corresponding path program 1 times [2018-11-28 13:37:24,297 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:24,297 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/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-11-28 13:37:24,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:37:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:24,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-28 13:37:24,453 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:37:24,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:24,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:37:24,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:37:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:37:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:37:24,455 INFO L87 Difference]: Start difference. First operand 263 states and 322 transitions. Second operand 3 states. [2018-11-28 13:37:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:24,473 INFO L93 Difference]: Finished difference Result 481 states and 600 transitions. [2018-11-28 13:37:24,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:37:24,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-11-28 13:37:24,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:24,475 INFO L225 Difference]: With dead ends: 481 [2018-11-28 13:37:24,475 INFO L226 Difference]: Without dead ends: 254 [2018-11-28 13:37:24,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:37:24,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-28 13:37:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2018-11-28 13:37:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-28 13:37:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 305 transitions. [2018-11-28 13:37:24,486 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 305 transitions. Word has length 111 [2018-11-28 13:37:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:24,487 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 305 transitions. [2018-11-28 13:37:24,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:37:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 305 transitions. [2018-11-28 13:37:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-28 13:37:24,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:24,488 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:24,488 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:24,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1486664420, now seen corresponding path program 1 times [2018-11-28 13:37:24,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:24,489 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:37:24,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:24,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 13:37:24,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:37:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:37:25,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:37:25,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-28 13:37:25,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:37:25,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:37:25,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:37:25,174 INFO L87 Difference]: Start difference. First operand 248 states and 305 transitions. Second operand 13 states. [2018-11-28 13:37:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:25,335 INFO L93 Difference]: Finished difference Result 480 states and 594 transitions. [2018-11-28 13:37:25,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:37:25,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2018-11-28 13:37:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:25,337 INFO L225 Difference]: With dead ends: 480 [2018-11-28 13:37:25,337 INFO L226 Difference]: Without dead ends: 249 [2018-11-28 13:37:25,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:37:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-28 13:37:25,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-11-28 13:37:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-11-28 13:37:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 306 transitions. [2018-11-28 13:37:25,350 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 306 transitions. Word has length 117 [2018-11-28 13:37:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:25,351 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 306 transitions. [2018-11-28 13:37:25,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:37:25,351 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 306 transitions. [2018-11-28 13:37:25,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-28 13:37:25,352 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:25,352 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:25,353 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:25,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:25,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1911980326, now seen corresponding path program 2 times [2018-11-28 13:37:25,353 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:25,355 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/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-11-28 13:37:25,394 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 13:37:25,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 13:37:25,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:37:25,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-28 13:37:25,780 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:37:25,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:25,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:37:25,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:37:25,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:37:25,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:37:25,789 INFO L87 Difference]: Start difference. First operand 249 states and 306 transitions. Second operand 6 states. [2018-11-28 13:37:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:26,294 INFO L93 Difference]: Finished difference Result 498 states and 614 transitions. [2018-11-28 13:37:26,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:37:26,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-11-28 13:37:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:26,296 INFO L225 Difference]: With dead ends: 498 [2018-11-28 13:37:26,297 INFO L226 Difference]: Without dead ends: 484 [2018-11-28 13:37:26,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:37:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-11-28 13:37:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 280. [2018-11-28 13:37:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-28 13:37:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 337 transitions. [2018-11-28 13:37:26,311 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 337 transitions. Word has length 119 [2018-11-28 13:37:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:26,311 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 337 transitions. [2018-11-28 13:37:26,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:37:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 337 transitions. [2018-11-28 13:37:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-28 13:37:26,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:26,313 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:26,313 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:26,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:26,313 INFO L82 PathProgramCache]: Analyzing trace with hash 255289994, now seen corresponding path program 1 times [2018-11-28 13:37:26,314 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:26,314 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/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-11-28 13:37:26,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:37:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:26,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:26,456 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-28 13:37:26,456 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:37:26,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:26,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:37:26,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:37:26,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:37:26,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:37:26,458 INFO L87 Difference]: Start difference. First operand 280 states and 337 transitions. Second operand 3 states. [2018-11-28 13:37:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:26,473 INFO L93 Difference]: Finished difference Result 416 states and 503 transitions. [2018-11-28 13:37:26,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:37:26,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-11-28 13:37:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:26,475 INFO L225 Difference]: With dead ends: 416 [2018-11-28 13:37:26,475 INFO L226 Difference]: Without dead ends: 289 [2018-11-28 13:37:26,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:37:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-28 13:37:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 280. [2018-11-28 13:37:26,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-28 13:37:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2018-11-28 13:37:26,484 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 128 [2018-11-28 13:37:26,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:26,484 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2018-11-28 13:37:26,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:37:26,484 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2018-11-28 13:37:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-28 13:37:26,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:26,485 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:26,485 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:26,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:26,486 INFO L82 PathProgramCache]: Analyzing trace with hash 121276488, now seen corresponding path program 1 times [2018-11-28 13:37:26,486 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:26,486 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:37:26,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:37:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:27,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 13:37:27,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:37:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 13:37:27,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:37:27,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-28 13:37:27,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-28 13:37:27,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 13:37:27,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:37:27,477 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand 15 states. [2018-11-28 13:37:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:27,693 INFO L93 Difference]: Finished difference Result 544 states and 654 transitions. [2018-11-28 13:37:27,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:37:27,694 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 128 [2018-11-28 13:37:27,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:27,695 INFO L225 Difference]: With dead ends: 544 [2018-11-28 13:37:27,695 INFO L226 Difference]: Without dead ends: 281 [2018-11-28 13:37:27,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:37:27,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-28 13:37:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-11-28 13:37:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-11-28 13:37:27,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 336 transitions. [2018-11-28 13:37:27,707 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 336 transitions. Word has length 128 [2018-11-28 13:37:27,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:27,707 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 336 transitions. [2018-11-28 13:37:27,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-28 13:37:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 336 transitions. [2018-11-28 13:37:27,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-28 13:37:27,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:27,709 INFO L402 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:27,709 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:27,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash -8579510, now seen corresponding path program 2 times [2018-11-28 13:37:27,709 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:27,710 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/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-11-28 13:37:27,744 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 13:37:28,397 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-11-28 13:37:28,397 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:37:28,397 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 13:37:28,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:37:28,612 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:37:28,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:37:28,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:28,665 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-11-28 13:37:28,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:37:28,825 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-28 13:37:28,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:37:28,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-11-28 13:37:28,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:37:28,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:37:28,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:37:28,854 INFO L87 Difference]: Start difference. First operand 281 states and 336 transitions. Second operand 13 states. [2018-11-28 13:37:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:29,082 INFO L93 Difference]: Finished difference Result 720 states and 878 transitions. [2018-11-28 13:37:29,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:37:29,083 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-11-28 13:37:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:29,084 INFO L225 Difference]: With dead ends: 720 [2018-11-28 13:37:29,084 INFO L226 Difference]: Without dead ends: 477 [2018-11-28 13:37:29,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:37:29,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-11-28 13:37:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 462. [2018-11-28 13:37:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-11-28 13:37:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 551 transitions. [2018-11-28 13:37:29,097 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 551 transitions. Word has length 130 [2018-11-28 13:37:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:29,097 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 551 transitions. [2018-11-28 13:37:29,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:37:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 551 transitions. [2018-11-28 13:37:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-28 13:37:29,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:37:29,099 INFO L402 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:37:29,100 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:37:29,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:37:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash 810441938, now seen corresponding path program 1 times [2018-11-28 13:37:29,100 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:37:29,100 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/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-11-28 13:37:29,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:37:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:37:30,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:37:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-28 13:37:31,047 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:37:31,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:37:31,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-28 13:37:31,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:37:31,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:37:31,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:37:31,053 INFO L87 Difference]: Start difference. First operand 462 states and 551 transitions. Second operand 14 states. [2018-11-28 13:37:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:37:36,234 INFO L93 Difference]: Finished difference Result 651 states and 782 transitions. [2018-11-28 13:37:36,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 13:37:36,235 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2018-11-28 13:37:36,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:37:36,236 INFO L225 Difference]: With dead ends: 651 [2018-11-28 13:37:36,236 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:37:36,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-11-28 13:37:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:37:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:37:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:37:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:37:36,237 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-11-28 13:37:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:37:36,237 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:37:36,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:37:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:37:36,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:37:36,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 13:37:36,647 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-11-28 13:37:37,237 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2018-11-28 13:37:37,396 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-11-28 13:37:37,519 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2018-11-28 13:37:37,703 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2018-11-28 13:37:37,945 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 7 [2018-11-28 13:37:38,211 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-11-28 13:37:38,543 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 14 [2018-11-28 13:37:38,546 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,546 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-28 13:37:38,546 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,547 INFO L451 ceAbstractionStarter]: At program point ldv_undef_intENTRY(lines 5900 5907) the Hoare annotation is: true [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point ldv_undef_intFINAL(lines 5900 5907) no Hoare annotation was computed. [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point ldv_undef_intEXIT(lines 5900 5907) no Hoare annotation was computed. [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 6151 6238) no Hoare annotation was computed. [2018-11-28 13:37:38,547 INFO L444 ceAbstractionStarter]: At program point L6163(line 6163) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point L6163-1(line 6163) no Hoare annotation was computed. [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point L6229(line 6229) no Hoare annotation was computed. [2018-11-28 13:37:38,547 INFO L451 ceAbstractionStarter]: At program point L6188(line 6188) the Hoare annotation is: true [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point L6180(line 6180) no Hoare annotation was computed. [2018-11-28 13:37:38,547 INFO L451 ceAbstractionStarter]: At program point L6230(line 6230) the Hoare annotation is: true [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point L6197(lines 6197 6224) no Hoare annotation was computed. [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point L6222(line 6222) no Hoare annotation was computed. [2018-11-28 13:37:38,547 INFO L448 ceAbstractionStarter]: For program point L6181(lines 6181 6185) no Hoare annotation was computed. [2018-11-28 13:37:38,548 INFO L448 ceAbstractionStarter]: For program point L6206(line 6206) no Hoare annotation was computed. [2018-11-28 13:37:38,548 INFO L448 ceAbstractionStarter]: For program point L6198(line 6198) no Hoare annotation was computed. [2018-11-28 13:37:38,548 INFO L444 ceAbstractionStarter]: At program point L6165(line 6165) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,548 INFO L448 ceAbstractionStarter]: For program point L6165-1(line 6165) no Hoare annotation was computed. [2018-11-28 13:37:38,548 INFO L451 ceAbstractionStarter]: At program point L6223(line 6223) the Hoare annotation is: true [2018-11-28 13:37:38,548 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 6151 6238) no Hoare annotation was computed. [2018-11-28 13:37:38,548 INFO L444 ceAbstractionStarter]: At program point L6182(line 6182) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-28 13:37:38,548 INFO L448 ceAbstractionStarter]: For program point L6182-1(line 6182) no Hoare annotation was computed. [2018-11-28 13:37:38,548 INFO L448 ceAbstractionStarter]: For program point L6207(lines 6207 6220) no Hoare annotation was computed. [2018-11-28 13:37:38,548 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 6151 6238) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,548 INFO L448 ceAbstractionStarter]: For program point L6199(lines 6199 6204) no Hoare annotation was computed. [2018-11-28 13:37:38,548 INFO L444 ceAbstractionStarter]: At program point L6232(lines 6162 6237) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-28 13:37:38,548 INFO L444 ceAbstractionStarter]: At program point L6216(lines 6162 6237) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,548 INFO L448 ceAbstractionStarter]: For program point L6208-1(line 6208) no Hoare annotation was computed. [2018-11-28 13:37:38,549 INFO L448 ceAbstractionStarter]: For program point L6175(lines 6175 6231) no Hoare annotation was computed. [2018-11-28 13:37:38,549 INFO L444 ceAbstractionStarter]: At program point L6208(line 6208) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= (bvadd ~ldv_state_variable_0~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-28 13:37:38,549 INFO L444 ceAbstractionStarter]: At program point L6167(line 6167) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,549 INFO L448 ceAbstractionStarter]: For program point L6200-1(line 6200) no Hoare annotation was computed. [2018-11-28 13:37:38,549 INFO L444 ceAbstractionStarter]: At program point L6167-1(line 6167) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,549 INFO L444 ceAbstractionStarter]: At program point L6200(line 6200) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,549 INFO L448 ceAbstractionStarter]: For program point L6209-2(lines 6207 6219) no Hoare annotation was computed. [2018-11-28 13:37:38,549 INFO L448 ceAbstractionStarter]: For program point L6209(lines 6209 6213) no Hoare annotation was computed. [2018-11-28 13:37:38,549 INFO L448 ceAbstractionStarter]: For program point L6176(line 6176) no Hoare annotation was computed. [2018-11-28 13:37:38,549 INFO L448 ceAbstractionStarter]: For program point L6168(line 6168) no Hoare annotation was computed. [2018-11-28 13:37:38,549 INFO L448 ceAbstractionStarter]: For program point L6177(lines 6177 6192) no Hoare annotation was computed. [2018-11-28 13:37:38,549 INFO L448 ceAbstractionStarter]: For program point L6235(line 6235) no Hoare annotation was computed. [2018-11-28 13:37:38,549 INFO L444 ceAbstractionStarter]: At program point L6169(line 6169) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,549 INFO L448 ceAbstractionStarter]: For program point L6169-1(line 6169) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point L6194(line 6194) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point L6195(lines 6195 6227) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point L6187(line 6187) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point L6179(lines 6179 6189) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L451 ceAbstractionStarter]: At program point L5886(line 5886) the Hoare annotation is: true [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point ldv_init_zallocFINAL(lines 5881 5891) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point L5886-1(line 5886) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point ldv_init_zallocEXIT(lines 5881 5891) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L451 ceAbstractionStarter]: At program point ldv_init_zallocENTRY(lines 5881 5891) the Hoare annotation is: true [2018-11-28 13:37:38,550 INFO L444 ceAbstractionStarter]: At program point ldv_try_module_getENTRY(lines 6309 6325) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-28 13:37:38,550 INFO L444 ceAbstractionStarter]: At program point L6314(line 6314) the Hoare annotation is: (or (and (= |ldv_try_module_get_#in~module.offset| ldv_try_module_get_~module.offset) (= (_ bv1 32) ~ldv_module_refcounter~0) (= |ldv_try_module_get_#in~module.base| ldv_try_module_get_~module.base) (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (bvadd |ldv_try_module_get_#in~module.offset| |ldv_try_module_get_#in~module.base|))))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point L6315(lines 6315 6320) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point L6313(lines 6313 6322) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point L6314-1(line 6314) no Hoare annotation was computed. [2018-11-28 13:37:38,550 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 6309 6325) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 6309 6325) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point pppox_initFINAL(lines 6133 6140) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L451 ceAbstractionStarter]: At program point pppox_initENTRY(lines 6133 6140) the Hoare annotation is: true [2018-11-28 13:37:38,551 INFO L451 ceAbstractionStarter]: At program point L6137(line 6137) the Hoare annotation is: true [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point L6137-1(line 6137) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point pppox_initEXIT(lines 6133 6140) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L451 ceAbstractionStarter]: At program point sock_unregisterENTRY(lines 6391 6393) the Hoare annotation is: true [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point sock_unregisterEXIT(lines 6391 6393) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point sock_unregisterFINAL(lines 6391 6393) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L451 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,551 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) [2018-11-28 13:37:38,551 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,552 INFO L448 ceAbstractionStarter]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6259) no Hoare annotation was computed. [2018-11-28 13:37:38,552 INFO L448 ceAbstractionStarter]: For program point ldv_errorFINAL(lines 6255 6261) no Hoare annotation was computed. [2018-11-28 13:37:38,552 INFO L451 ceAbstractionStarter]: At program point ldv_errorENTRY(lines 6255 6261) the Hoare annotation is: true [2018-11-28 13:37:38,552 INFO L448 ceAbstractionStarter]: For program point ldv_errorEXIT(lines 6255 6261) no Hoare annotation was computed. [2018-11-28 13:37:38,552 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_5EXIT(lines 6239 6246) no Hoare annotation was computed. [2018-11-28 13:37:38,552 INFO L444 ceAbstractionStarter]: At program point ldv_try_module_get_5ENTRY(lines 6239 6246) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-28 13:37:38,552 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_5FINAL(lines 6239 6246) no Hoare annotation was computed. [2018-11-28 13:37:38,552 INFO L444 ceAbstractionStarter]: At program point L6243(line 6243) the Hoare annotation is: (or (and (= |ldv_try_module_get_5_#in~ldv_func_arg1.offset| ldv_try_module_get_5_~ldv_func_arg1.offset) (= ldv_try_module_get_5_~ldv_func_arg1.base |ldv_try_module_get_5_#in~ldv_func_arg1.base|) (= (_ bv1 32) ~ldv_module_refcounter~0)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,552 INFO L448 ceAbstractionStarter]: For program point L6243-1(line 6243) no Hoare annotation was computed. [2018-11-28 13:37:38,552 INFO L448 ceAbstractionStarter]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2018-11-28 13:37:38,552 INFO L444 ceAbstractionStarter]: At program point L6126(line 6126) the Hoare annotation is: (or (and (= (bvadd |old(~ldv_module_refcounter~0)| (_ bv1 32)) ~ldv_module_refcounter~0) (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (let ((.cse2 (bvadd (bvmul (_ bv8 32) pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))))) (= (_ bv1 8) pppox_create_~tmp~9) (= (_ bv0 32) pppox_create_~tmp___0~3)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,553 INFO L444 ceAbstractionStarter]: At program point L6128(lines 6101 6130) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-28 13:37:38,553 INFO L448 ceAbstractionStarter]: For program point pppox_createFINAL(lines 6096 6131) no Hoare annotation was computed. [2018-11-28 13:37:38,553 INFO L448 ceAbstractionStarter]: For program point L6126-1(line 6126) no Hoare annotation was computed. [2018-11-28 13:37:38,553 INFO L448 ceAbstractionStarter]: For program point L6116-2(lines 6114 6125) no Hoare annotation was computed. [2018-11-28 13:37:38,553 INFO L448 ceAbstractionStarter]: For program point L6116(lines 6116 6120) no Hoare annotation was computed. [2018-11-28 13:37:38,553 INFO L448 ceAbstractionStarter]: For program point L6112(lines 6112 6125) no Hoare annotation was computed. [2018-11-28 13:37:38,553 INFO L444 ceAbstractionStarter]: At program point pppox_createENTRY(lines 6096 6131) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-28 13:37:38,553 INFO L448 ceAbstractionStarter]: For program point L6108-2(lines 6108 6111) no Hoare annotation was computed. [2018-11-28 13:37:38,553 INFO L448 ceAbstractionStarter]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2018-11-28 13:37:38,553 INFO L444 ceAbstractionStarter]: At program point L6127(line 6127) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (and (= (bvadd |old(~ldv_module_refcounter~0)| (_ bv1 32)) ~ldv_module_refcounter~0) (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (let ((.cse2 (bvadd (bvmul (_ bv8 32) pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))))) (= (_ bv1 8) pppox_create_~tmp~9) (= (_ bv0 32) pppox_create_~tmp___0~3) (exists ((pppox_create_~protocol (_ BitVec 32))) (let ((.cse7 (bvadd (bvmul (_ bv8 32) pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7) (_ bv16 32)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (and (= |pppox_create_#t~mem67.base| .cse3) (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (bvadd .cse4 .cse3)))) (= |pppox_create_#t~mem67.offset| .cse4)))))))) [2018-11-28 13:37:38,553 INFO L448 ceAbstractionStarter]: For program point L6127-1(line 6127) no Hoare annotation was computed. [2018-11-28 13:37:38,553 INFO L448 ceAbstractionStarter]: For program point pppox_createEXIT(lines 6096 6131) no Hoare annotation was computed. [2018-11-28 13:37:38,554 INFO L444 ceAbstractionStarter]: At program point L6115(line 6115) the Hoare annotation is: (or (let ((.cse2 (bvadd (bvmul (_ bv8 32) pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (and (= |pppox_create_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= (_ bv1 32) ~ldv_module_refcounter~0) (= |pppox_create_#t~mem56.base| (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-28 13:37:38,554 INFO L448 ceAbstractionStarter]: For program point L6115-1(line 6115) no Hoare annotation was computed. [2018-11-28 13:37:38,554 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 6354 6363) the Hoare annotation is: true [2018-11-28 13:37:38,554 INFO L444 ceAbstractionStarter]: At program point L6358(line 6358) the Hoare annotation is: (not (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-28 13:37:38,554 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 6354 6363) no Hoare annotation was computed. [2018-11-28 13:37:38,554 INFO L448 ceAbstractionStarter]: For program point L6357(lines 6354 6363) no Hoare annotation was computed. [2018-11-28 13:37:38,554 INFO L448 ceAbstractionStarter]: For program point ldv_stopFINAL(lines 5924 5930) no Hoare annotation was computed. [2018-11-28 13:37:38,554 INFO L448 ceAbstractionStarter]: For program point ldv_stopEXIT(lines 5924 5930) no Hoare annotation was computed. [2018-11-28 13:37:38,554 INFO L451 ceAbstractionStarter]: At program point ldv_stopENTRY(lines 5924 5930) the Hoare annotation is: true [2018-11-28 13:37:38,554 INFO L451 ceAbstractionStarter]: At program point sock_registerENTRY(lines 6388 6390) the Hoare annotation is: true [2018-11-28 13:37:38,554 INFO L448 ceAbstractionStarter]: For program point sock_registerEXIT(lines 6388 6390) no Hoare annotation was computed. [2018-11-28 13:37:38,554 INFO L448 ceAbstractionStarter]: For program point sock_registerFINAL(lines 6388 6390) no Hoare annotation was computed. [2018-11-28 13:37:38,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,554 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) [2018-11-28 13:37:38,555 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:37:38,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,555 INFO L451 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 6371 6373) the Hoare annotation is: true [2018-11-28 13:37:38,555 INFO L448 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 6371 6373) no Hoare annotation was computed. [2018-11-28 13:37:38,555 INFO L448 ceAbstractionStarter]: For program point L6330(lines 6330 6333) no Hoare annotation was computed. [2018-11-28 13:37:38,555 INFO L444 ceAbstractionStarter]: At program point L6331(line 6331) the Hoare annotation is: (or (not (= (_ bv2 32) |old(~ldv_module_refcounter~0)|)) (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 (_ BitVec 32))) (= ((_ sign_extend 32) (let ((.cse2 (bvadd |~#pppox_protos~0.offset| (bvmul (_ bv8 32) v_pppox_create_~protocol_BEFORE_CALL_2)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) ((_ sign_extend 32) (_ bv0 32))))) [2018-11-28 13:37:38,555 INFO L448 ceAbstractionStarter]: For program point L6329-2(lines 6326 6339) no Hoare annotation was computed. [2018-11-28 13:37:38,555 INFO L444 ceAbstractionStarter]: At program point ldv_module_putENTRY(lines 6326 6339) the Hoare annotation is: (or (not (= (_ bv2 32) |old(~ldv_module_refcounter~0)|)) (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 (_ BitVec 32))) (= ((_ sign_extend 32) (let ((.cse2 (bvadd |~#pppox_protos~0.offset| (bvmul (_ bv8 32) v_pppox_create_~protocol_BEFORE_CALL_2)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) ((_ sign_extend 32) (_ bv0 32)))) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-28 13:37:38,555 INFO L448 ceAbstractionStarter]: For program point L6329(lines 6329 6336) no Hoare annotation was computed. [2018-11-28 13:37:38,555 INFO L448 ceAbstractionStarter]: For program point L6330-1(lines 6330 6333) no Hoare annotation was computed. [2018-11-28 13:37:38,555 INFO L448 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 6326 6339) no Hoare annotation was computed. [2018-11-28 13:37:38,555 INFO L448 ceAbstractionStarter]: For program point ldv_memsetFINAL(lines 5892 5899) no Hoare annotation was computed. [2018-11-28 13:37:38,555 INFO L448 ceAbstractionStarter]: For program point L5896-1(line 5896) no Hoare annotation was computed. [2018-11-28 13:37:38,556 INFO L451 ceAbstractionStarter]: At program point ldv_memsetENTRY(lines 5892 5899) the Hoare annotation is: true [2018-11-28 13:37:38,556 INFO L444 ceAbstractionStarter]: At program point L5896(line 5896) the Hoare annotation is: (or (= |ldv_memset_#in~n| ldv_memset_~n) (not (= (_ bv0 32) ~ldv_state_variable_1~0)) (not (= (_ bv1 32) ~ldv_module_refcounter~0))) [2018-11-28 13:37:38,556 INFO L448 ceAbstractionStarter]: For program point ldv_memsetEXIT(lines 5892 5899) no Hoare annotation was computed. [2018-11-28 13:37:38,556 INFO L451 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:37:38,556 INFO L448 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,556 INFO L448 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:37:38,556 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_6EXIT(lines 6247 6253) no Hoare annotation was computed. [2018-11-28 13:37:38,556 INFO L444 ceAbstractionStarter]: At program point L6250(line 6250) the Hoare annotation is: (or (not (= (_ bv2 32) |old(~ldv_module_refcounter~0)|)) (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 (_ BitVec 32))) (= ((_ sign_extend 32) (let ((.cse2 (bvadd |~#pppox_protos~0.offset| (bvmul (_ bv8 32) v_pppox_create_~protocol_BEFORE_CALL_2)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) ((_ sign_extend 32) (_ bv0 32)))) (and (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) (= ldv_module_put_6_~ldv_func_arg1.offset |ldv_module_put_6_#in~ldv_func_arg1.offset|) (= |ldv_module_put_6_#in~ldv_func_arg1.base| ldv_module_put_6_~ldv_func_arg1.base))) [2018-11-28 13:37:38,556 INFO L444 ceAbstractionStarter]: At program point ldv_module_put_6ENTRY(lines 6247 6253) the Hoare annotation is: (or (not (= (_ bv2 32) |old(~ldv_module_refcounter~0)|)) (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 (_ BitVec 32))) (= ((_ sign_extend 32) (let ((.cse2 (bvadd |~#pppox_protos~0.offset| (bvmul (_ bv8 32) v_pppox_create_~protocol_BEFORE_CALL_2)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) ((_ sign_extend 32) (_ bv0 32)))) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-28 13:37:38,556 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_6FINAL(lines 6247 6253) no Hoare annotation was computed. [2018-11-28 13:37:38,556 INFO L448 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 6141 6147) no Hoare annotation was computed. [2018-11-28 13:37:38,556 INFO L451 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 6141 6147) the Hoare annotation is: true [2018-11-28 13:37:38,556 INFO L448 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 6141 6147) no Hoare annotation was computed. [2018-11-28 13:37:38,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:37:38 BoogieIcfgContainer [2018-11-28 13:37:38,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:37:38,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:37:38,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:37:38,573 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:37:38,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:37:21" (3/4) ... [2018-11-28 13:37:38,576 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:37:38,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-28 13:37:38,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2018-11-28 13:37:38,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:37:38,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2018-11-28 13:37:38,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-11-28 13:37:38,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-11-28 13:37:38,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_unregister [2018-11-28 13:37:38,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-11-28 13:37:38,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:37:38,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2018-11-28 13:37:38,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_5 [2018-11-28 13:37:38,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-11-28 13:37:38,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-28 13:37:38,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2018-11-28 13:37:38,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_register [2018-11-28 13:37:38,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_initialize [2018-11-28 13:37:38,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-11-28 13:37:38,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2018-11-28 13:37:38,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2018-11-28 13:37:38,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_6 [2018-11-28 13:37:38,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-11-28 13:37:38,589 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2018-11-28 13:37:38,590 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-11-28 13:37:38,590 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-28 13:37:38,590 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 13:37:38,591 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 13:37:38,608 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_state_variable_1)) || !(1bv32 == \old(ldv_module_refcounter))) || 1bv32 == ldv_module_refcounter [2018-11-28 13:37:38,608 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_state_variable_1)) || 1bv32 == ldv_module_refcounter) || !(1bv32 == \old(ldv_module_refcounter)) [2018-11-28 13:37:38,609 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1bv32 == \old(ldv_module_refcounter)) || 1bv32 == ldv_module_refcounter [2018-11-28 13:37:38,639 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c97cc54d-f2e1-4acc-9963-db4c33eb7a51/bin-2019/uautomizer/witness.graphml [2018-11-28 13:37:38,639 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:37:38,639 INFO L168 Benchmark]: Toolchain (without parser) took 19172.99 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.8 MB). Free memory was 936.7 MB in the beginning and 896.4 MB in the end (delta: 40.3 MB). Peak memory consumption was 402.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:38,640 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:37:38,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 877.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:38,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.79 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-11-28 13:37:38,641 INFO L168 Benchmark]: Boogie Preprocessor took 45.45 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:38,641 INFO L168 Benchmark]: RCFGBuilder took 612.76 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:38,641 INFO L168 Benchmark]: TraceAbstraction took 17536.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 905.2 MB in the end (delta: 146.5 MB). Peak memory consumption was 324.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:38,641 INFO L168 Benchmark]: Witness Printer took 66.84 ms. Allocated memory is still 1.4 GB. Free memory was 905.2 MB in the beginning and 896.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:37:38,645 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 877.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.5 MB). Free memory was 936.7 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.79 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 45.45 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 612.76 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: 58.4 MB). Peak memory consumption was 58.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17536.25 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 905.2 MB in the end (delta: 146.5 MB). Peak memory consumption was 324.8 MB. Max. memory is 11.5 GB. * Witness Printer took 66.84 ms. Allocated memory is still 1.4 GB. Free memory was 905.2 MB in the beginning and 896.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6259]: 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: 5924]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6101]: Loop Invariant Derived loop invariant: !(1bv32 == \old(ldv_module_refcounter)) || 1bv32 == ldv_module_refcounter - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6162]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_state_variable_1)) || !(1bv32 == \old(ldv_module_refcounter))) || 1bv32 == ldv_module_refcounter - InvariantResult [Line: 6162]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_state_variable_1)) || 1bv32 == ldv_module_refcounter) || !(1bv32 == \old(ldv_module_refcounter)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 138 locations, 1 error locations. SAFE Result, 17.4s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2110 SDtfs, 775 SDslu, 8789 SDs, 0 SdLazy, 1144 SolverSat, 159 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1970 GetRequests, 1861 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 264 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 49 LocationsWithAnnotation, 640 PreInvPairs, 691 NumberOfFragments, 824 HoareAnnotationTreeSize, 640 FomulaSimplifications, 6498 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 49 FomulaSimplificationsInter, 5707 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1936 ConstructedInterpolants, 12 QuantifiedInterpolants, 461404 SizeOfPredicates, 43 NumberOfNonLiveVariables, 6908 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 598/667 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...