./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/config/TaipanReach.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_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash af2001ab830213f8cdb559c777be1d107ce8fe72 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/config/TaipanReach.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_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash af2001ab830213f8cdb559c777be1d107ce8fe72 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 05:04:19,770 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:04:19,771 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:04:19,777 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:04:19,778 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:04:19,778 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:04:19,779 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:04:19,780 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:04:19,782 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:04:19,782 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:04:19,783 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:04:19,783 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:04:19,784 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:04:19,784 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:04:19,785 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:04:19,785 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:04:19,785 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:04:19,786 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:04:19,788 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:04:19,788 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:04:19,789 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:04:19,789 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:04:19,790 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:04:19,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:04:19,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:04:19,791 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:04:19,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:04:19,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:04:19,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:04:19,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:04:19,793 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:04:19,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:04:19,794 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:04:19,794 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:04:19,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:04:19,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:04:19,795 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-12-09 05:04:19,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:04:19,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:04:19,803 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:04:19,803 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:04:19,803 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:04:19,804 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:04:19,804 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:04:19,804 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 05:04:19,804 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:04:19,804 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:04:19,804 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-09 05:04:19,804 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 05:04:19,804 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 05:04:19,804 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:04:19,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:04:19,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:04:19,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:04:19,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:04:19,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:04:19,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:04:19,805 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:04:19,805 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:04:19,805 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:04:19,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:04:19,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 05:04:19,806 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-12-09 05:04:19,807 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af2001ab830213f8cdb559c777be1d107ce8fe72 [2018-12-09 05:04:19,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:04:19,830 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:04:19,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:04:19,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:04:19,833 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:04:19,833 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/../../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-12-09 05:04:19,867 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data/deaa847ee/2fb1ec0328ee41d79714f5917cfc4986/FLAGe6cbae2db [2018-12-09 05:04:20,381 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:04:20,382 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/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-12-09 05:04:20,397 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data/deaa847ee/2fb1ec0328ee41d79714f5917cfc4986/FLAGe6cbae2db [2018-12-09 05:04:20,900 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data/deaa847ee/2fb1ec0328ee41d79714f5917cfc4986 [2018-12-09 05:04:20,902 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:04:20,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:04:20,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:04:20,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:04:20,906 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:04:20,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:04:20" (1/1) ... [2018-12-09 05:04:20,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7401f4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:20, skipping insertion in model container [2018-12-09 05:04:20,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:04:20" (1/1) ... [2018-12-09 05:04:20,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:04:20,960 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:04:21,478 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:04:21,492 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:04:21,595 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:04:21,615 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:04:21,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21 WrapperNode [2018-12-09 05:04:21,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:04:21,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:04:21,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:04:21,616 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:04:21,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... [2018-12-09 05:04:21,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... [2018-12-09 05:04:21,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:04:21,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:04:21,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:04:21,640 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:04:21,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... [2018-12-09 05:04:21,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... [2018-12-09 05:04:21,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... [2018-12-09 05:04:21,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... [2018-12-09 05:04:21,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... [2018-12-09 05:04:21,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... [2018-12-09 05:04:21,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... [2018-12-09 05:04:21,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:04:21,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:04:21,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:04:21,671 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:04:21,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:04:21,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-12-09 05:04:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-12-09 05:04:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:04:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:04:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-12-09 05:04:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-12-09 05:04:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:04:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-12-09 05:04:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-12-09 05:04:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-09 05:04:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-09 05:04:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 05:04:21,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-12-09 05:04:21,704 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-12-09 05:04:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 05:04:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-12-09 05:04:21,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-12-09 05:04:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-12-09 05:04:21,705 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-12-09 05:04:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-12-09 05:04:21,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-12-09 05:04:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-12-09 05:04:21,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-12-09 05:04:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 05:04:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 05:04:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-12-09 05:04:21,705 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-12-09 05:04:21,705 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-12-09 05:04:21,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-12-09 05:04:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-12-09 05:04:21,706 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-12-09 05:04:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-12-09 05:04:21,706 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-12-09 05:04:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-09 05:04:21,706 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-09 05:04:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-12-09 05:04:21,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-12-09 05:04:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-09 05:04:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:04:21,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:04:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-12-09 05:04:21,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-12-09 05:04:21,706 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-09 05:04:21,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-09 05:04:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-12-09 05:04:21,707 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-12-09 05:04:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:04:21,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:04:21,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-12-09 05:04:21,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-12-09 05:04:22,050 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:04:22,050 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 05:04:22,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:04:22 BoogieIcfgContainer [2018-12-09 05:04:22,051 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:04:22,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:04:22,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:04:22,055 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:04:22,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:04:20" (1/3) ... [2018-12-09 05:04:22,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b9cb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:04:22, skipping insertion in model container [2018-12-09 05:04:22,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:04:21" (2/3) ... [2018-12-09 05:04:22,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b9cb4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:04:22, skipping insertion in model container [2018-12-09 05:04:22,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:04:22" (3/3) ... [2018-12-09 05:04:22,058 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-12-09 05:04:22,065 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:04:22,070 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 05:04:22,080 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 05:04:22,100 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:04:22,100 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:04:22,100 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:04:22,100 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:04:22,100 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:04:22,100 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:04:22,100 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:04:22,100 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:04:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-12-09 05:04:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 05:04:22,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:22,118 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] [2018-12-09 05:04:22,120 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:22,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash 2145327332, now seen corresponding path program 1 times [2018-12-09 05:04:22,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:22,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:22,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 05:04:22,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:22,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:22,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:22,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:22,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:22,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:22,378 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-12-09 05:04:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:22,439 INFO L93 Difference]: Finished difference Result 308 states and 394 transitions. [2018-12-09 05:04:22,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:22,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-09 05:04:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:22,450 INFO L225 Difference]: With dead ends: 308 [2018-12-09 05:04:22,450 INFO L226 Difference]: Without dead ends: 191 [2018-12-09 05:04:22,453 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-12-09 05:04:22,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-09 05:04:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-12-09 05:04:22,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-09 05:04:22,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 229 transitions. [2018-12-09 05:04:22,493 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 229 transitions. Word has length 71 [2018-12-09 05:04:22,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:22,494 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 229 transitions. [2018-12-09 05:04:22,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 229 transitions. [2018-12-09 05:04:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 05:04:22,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:22,496 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] [2018-12-09 05:04:22,496 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:22,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:22,496 INFO L82 PathProgramCache]: Analyzing trace with hash -897537356, now seen corresponding path program 1 times [2018-12-09 05:04:22,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:22,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:22,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 05:04:22,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:22,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:22,591 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:22,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:22,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:22,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:22,593 INFO L87 Difference]: Start difference. First operand 188 states and 229 transitions. Second operand 3 states. [2018-12-09 05:04:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:22,624 INFO L93 Difference]: Finished difference Result 198 states and 237 transitions. [2018-12-09 05:04:22,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:22,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-09 05:04:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:22,626 INFO L225 Difference]: With dead ends: 198 [2018-12-09 05:04:22,626 INFO L226 Difference]: Without dead ends: 193 [2018-12-09 05:04:22,627 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-12-09 05:04:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-09 05:04:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2018-12-09 05:04:22,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-09 05:04:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 228 transitions. [2018-12-09 05:04:22,638 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 228 transitions. Word has length 76 [2018-12-09 05:04:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:22,639 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 228 transitions. [2018-12-09 05:04:22,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 228 transitions. [2018-12-09 05:04:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 05:04:22,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:22,640 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] [2018-12-09 05:04:22,640 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:22,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:22,640 INFO L82 PathProgramCache]: Analyzing trace with hash -840279054, now seen corresponding path program 1 times [2018-12-09 05:04:22,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:22,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:22,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:22,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 05:04:22,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:22,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:22,703 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:22,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:22,703 INFO L87 Difference]: Start difference. First operand 188 states and 228 transitions. Second operand 3 states. [2018-12-09 05:04:22,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:22,729 INFO L93 Difference]: Finished difference Result 491 states and 615 transitions. [2018-12-09 05:04:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:22,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-09 05:04:22,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:22,733 INFO L225 Difference]: With dead ends: 491 [2018-12-09 05:04:22,733 INFO L226 Difference]: Without dead ends: 328 [2018-12-09 05:04:22,734 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-12-09 05:04:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-09 05:04:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2018-12-09 05:04:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-09 05:04:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 403 transitions. [2018-12-09 05:04:22,758 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 403 transitions. Word has length 76 [2018-12-09 05:04:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:22,758 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 403 transitions. [2018-12-09 05:04:22,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 403 transitions. [2018-12-09 05:04:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-09 05:04:22,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:22,761 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] [2018-12-09 05:04:22,761 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:22,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1016867802, now seen corresponding path program 1 times [2018-12-09 05:04:22,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:22,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:22,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-09 05:04:22,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:22,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:22,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:22,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:22,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:22,823 INFO L87 Difference]: Start difference. First operand 324 states and 403 transitions. Second operand 3 states. [2018-12-09 05:04:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:22,872 INFO L93 Difference]: Finished difference Result 702 states and 883 transitions. [2018-12-09 05:04:22,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:22,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-09 05:04:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:22,875 INFO L225 Difference]: With dead ends: 702 [2018-12-09 05:04:22,875 INFO L226 Difference]: Without dead ends: 413 [2018-12-09 05:04:22,876 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-12-09 05:04:22,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-12-09 05:04:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 400. [2018-12-09 05:04:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-09 05:04:22,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 503 transitions. [2018-12-09 05:04:22,898 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 503 transitions. Word has length 90 [2018-12-09 05:04:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:22,898 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 503 transitions. [2018-12-09 05:04:22,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 503 transitions. [2018-12-09 05:04:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 05:04:22,900 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:22,900 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-12-09 05:04:22,901 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:22,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:22,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2136446144, now seen corresponding path program 1 times [2018-12-09 05:04:22,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:22,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:22,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:22,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 05:04:23,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:23,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:04:23,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:23,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:04:23,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:04:23,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:04:23,009 INFO L87 Difference]: Start difference. First operand 400 states and 503 transitions. Second operand 7 states. [2018-12-09 05:04:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:23,060 INFO L93 Difference]: Finished difference Result 801 states and 1015 transitions. [2018-12-09 05:04:23,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:04:23,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-09 05:04:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:23,063 INFO L225 Difference]: With dead ends: 801 [2018-12-09 05:04:23,063 INFO L226 Difference]: Without dead ends: 436 [2018-12-09 05:04:23,064 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-12-09 05:04:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-12-09 05:04:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 430. [2018-12-09 05:04:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-12-09 05:04:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 537 transitions. [2018-12-09 05:04:23,080 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 537 transitions. Word has length 109 [2018-12-09 05:04:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:23,081 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 537 transitions. [2018-12-09 05:04:23,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:04:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 537 transitions. [2018-12-09 05:04:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 05:04:23,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:23,082 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-12-09 05:04:23,082 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:23,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash 856582466, now seen corresponding path program 1 times [2018-12-09 05:04:23,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:23,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:23,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 05:04:23,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:23,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:23,143 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:23,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:23,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:23,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:23,144 INFO L87 Difference]: Start difference. First operand 430 states and 537 transitions. Second operand 3 states. [2018-12-09 05:04:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:23,162 INFO L93 Difference]: Finished difference Result 800 states and 1016 transitions. [2018-12-09 05:04:23,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:23,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-12-09 05:04:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:23,164 INFO L225 Difference]: With dead ends: 800 [2018-12-09 05:04:23,164 INFO L226 Difference]: Without dead ends: 405 [2018-12-09 05:04:23,165 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-12-09 05:04:23,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-12-09 05:04:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 393. [2018-12-09 05:04:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-09 05:04:23,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 490 transitions. [2018-12-09 05:04:23,180 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 490 transitions. Word has length 109 [2018-12-09 05:04:23,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:23,181 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 490 transitions. [2018-12-09 05:04:23,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:23,181 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 490 transitions. [2018-12-09 05:04:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 05:04:23,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:23,182 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, 1, 1, 1, 1, 1, 1] [2018-12-09 05:04:23,182 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:23,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:23,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1389124644, now seen corresponding path program 1 times [2018-12-09 05:04:23,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:23,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:23,296 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 05:04:23,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:23,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:04:23,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:23,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:04:23,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:04:23,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:04:23,297 INFO L87 Difference]: Start difference. First operand 393 states and 490 transitions. Second operand 7 states. [2018-12-09 05:04:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:23,627 INFO L93 Difference]: Finished difference Result 638 states and 790 transitions. [2018-12-09 05:04:23,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 05:04:23,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 05:04:23,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:23,629 INFO L225 Difference]: With dead ends: 638 [2018-12-09 05:04:23,630 INFO L226 Difference]: Without dead ends: 635 [2018-12-09 05:04:23,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-09 05:04:23,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-12-09 05:04:23,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 600. [2018-12-09 05:04:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-09 05:04:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 753 transitions. [2018-12-09 05:04:23,645 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 753 transitions. Word has length 115 [2018-12-09 05:04:23,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:23,646 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 753 transitions. [2018-12-09 05:04:23,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:04:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 753 transitions. [2018-12-09 05:04:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 05:04:23,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:23,647 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] [2018-12-09 05:04:23,647 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:23,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:23,648 INFO L82 PathProgramCache]: Analyzing trace with hash 577868148, now seen corresponding path program 1 times [2018-12-09 05:04:23,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:23,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 05:04:23,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:23,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:04:23,709 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:23,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:04:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:04:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:04:23,709 INFO L87 Difference]: Start difference. First operand 600 states and 753 transitions. Second operand 3 states. [2018-12-09 05:04:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:23,725 INFO L93 Difference]: Finished difference Result 1034 states and 1298 transitions. [2018-12-09 05:04:23,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:04:23,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-12-09 05:04:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:23,727 INFO L225 Difference]: With dead ends: 1034 [2018-12-09 05:04:23,727 INFO L226 Difference]: Without dead ends: 612 [2018-12-09 05:04:23,728 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-12-09 05:04:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-09 05:04:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 600. [2018-12-09 05:04:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-09 05:04:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 749 transitions. [2018-12-09 05:04:23,743 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 749 transitions. Word has length 124 [2018-12-09 05:04:23,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:23,743 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 749 transitions. [2018-12-09 05:04:23,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:04:23,743 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 749 transitions. [2018-12-09 05:04:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-09 05:04:23,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:23,744 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] [2018-12-09 05:04:23,744 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:23,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:23,745 INFO L82 PathProgramCache]: Analyzing trace with hash 443854642, now seen corresponding path program 1 times [2018-12-09 05:04:23,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:23,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:23,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 05:04:23,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:04:23,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 05:04:23,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:23,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 05:04:23,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 05:04:23,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 05:04:23,835 INFO L87 Difference]: Start difference. First operand 600 states and 749 transitions. Second operand 7 states. [2018-12-09 05:04:23,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:23,865 INFO L93 Difference]: Finished difference Result 1026 states and 1280 transitions. [2018-12-09 05:04:23,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 05:04:23,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-12-09 05:04:23,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:23,868 INFO L225 Difference]: With dead ends: 1026 [2018-12-09 05:04:23,868 INFO L226 Difference]: Without dead ends: 604 [2018-12-09 05:04:23,869 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-12-09 05:04:23,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-12-09 05:04:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2018-12-09 05:04:23,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-12-09 05:04:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 743 transitions. [2018-12-09 05:04:23,892 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 743 transitions. Word has length 124 [2018-12-09 05:04:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:23,892 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 743 transitions. [2018-12-09 05:04:23,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 05:04:23,893 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 743 transitions. [2018-12-09 05:04:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-09 05:04:23,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:23,894 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-12-09 05:04:23,895 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:23,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:23,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1431815232, now seen corresponding path program 1 times [2018-12-09 05:04:23,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:23,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:23,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:23,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 05:04:24,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:04:24,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 05:04:24,040 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-12-09 05:04:24,042 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [4], [6], [9], [11], [13], [16], [19], [22], [25], [27], [46], [49], [52], [55], [58], [60], [64], [67], [70], [72], [75], [83], [116], [119], [121], [124], [127], [128], [129], [130], [133], [138], [141], [145], [150], [152], [155], [163], [165], [167], [169], [170], [174], [175], [181], [182], [184], [185], [191], [192], [193], [194], [195], [197], [198], [199], [201], [202], [203], [204], [205], [207], [208], [211], [217], [218], [222], [235], [237], [238], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [251], [252], [253], [254], [255], [256], [259], [260], [261], [262], [267], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [287], [288], [289], [293], [294], [295], [296] [2018-12-09 05:04:24,066 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 05:04:24,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 05:04:25,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 05:04:25,144 INFO L272 AbstractInterpreter]: Visited 118 different actions 499 times. Merged at 21 different actions 88 times. Widened at 1 different actions 2 times. Performed 15229 root evaluator evaluations with a maximum evaluation depth of 10. Performed 15229 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 7 fixpoints after 4 different actions. Largest state had 131 variables. [2018-12-09 05:04:25,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:25,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 05:04:25,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:04:25,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:04:25,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:25,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 05:04:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:25,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:04:25,364 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 05:04:25,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 05:04:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 05:04:25,573 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 05:04:25,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 12 [2018-12-09 05:04:25,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:25,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:04:25,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:04:25,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-09 05:04:25,574 INFO L87 Difference]: Start difference. First operand 598 states and 743 transitions. Second operand 6 states. [2018-12-09 05:04:25,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:25,634 INFO L93 Difference]: Finished difference Result 1195 states and 1486 transitions. [2018-12-09 05:04:25,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:04:25,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-12-09 05:04:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:25,636 INFO L225 Difference]: With dead ends: 1195 [2018-12-09 05:04:25,636 INFO L226 Difference]: Without dead ends: 599 [2018-12-09 05:04:25,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-09 05:04:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-12-09 05:04:25,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2018-12-09 05:04:25,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-12-09 05:04:25,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 744 transitions. [2018-12-09 05:04:25,652 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 744 transitions. Word has length 139 [2018-12-09 05:04:25,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:25,652 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 744 transitions. [2018-12-09 05:04:25,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:04:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 744 transitions. [2018-12-09 05:04:25,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-09 05:04:25,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:25,653 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, 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-12-09 05:04:25,653 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:25,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:25,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1548976622, now seen corresponding path program 1 times [2018-12-09 05:04:25,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:25,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:25,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:25,750 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 05:04:25,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:04:25,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 05:04:25,751 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-12-09 05:04:25,751 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [4], [6], [9], [11], [13], [16], [19], [22], [25], [27], [46], [49], [52], [55], [58], [60], [64], [67], [70], [72], [75], [83], [116], [119], [121], [124], [127], [128], [129], [130], [133], [138], [141], [145], [150], [152], [155], [163], [165], [167], [169], [170], [174], [175], [179], [181], [182], [184], [185], [191], [192], [193], [194], [195], [197], [198], [199], [201], [202], [203], [204], [205], [207], [208], [211], [217], [218], [222], [235], [237], [238], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [251], [252], [253], [254], [255], [256], [259], [260], [261], [262], [267], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [287], [288], [289], [293], [294], [295], [296] [2018-12-09 05:04:25,754 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 05:04:25,754 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 05:04:26,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 05:04:26,523 INFO L272 AbstractInterpreter]: Visited 119 different actions 517 times. Merged at 24 different actions 100 times. Widened at 1 different actions 2 times. Performed 15333 root evaluator evaluations with a maximum evaluation depth of 10. Performed 15333 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 6 different actions. Largest state had 131 variables. [2018-12-09 05:04:26,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:26,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 05:04:26,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:04:26,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:04:26,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:26,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 05:04:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:26,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:04:26,685 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 05:04:26,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 05:04:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 05:04:26,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:04:26,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2018-12-09 05:04:26,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 05:04:26,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:04:26,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:04:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 05:04:26,893 INFO L87 Difference]: Start difference. First operand 599 states and 744 transitions. Second operand 6 states. [2018-12-09 05:04:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:04:26,953 INFO L93 Difference]: Finished difference Result 1180 states and 1469 transitions. [2018-12-09 05:04:26,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:04:26,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-12-09 05:04:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:04:26,956 INFO L225 Difference]: With dead ends: 1180 [2018-12-09 05:04:26,956 INFO L226 Difference]: Without dead ends: 600 [2018-12-09 05:04:26,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 274 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 05:04:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-12-09 05:04:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2018-12-09 05:04:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-09 05:04:26,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 745 transitions. [2018-12-09 05:04:26,972 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 745 transitions. Word has length 141 [2018-12-09 05:04:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:04:26,972 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 745 transitions. [2018-12-09 05:04:26,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:04:26,972 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 745 transitions. [2018-12-09 05:04:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-09 05:04:26,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:04:26,973 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, 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-12-09 05:04:26,974 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:04:26,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:26,974 INFO L82 PathProgramCache]: Analyzing trace with hash 620175688, now seen corresponding path program 1 times [2018-12-09 05:04:26,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 05:04:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:26,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:26,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 05:04:26,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 05:04:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-09 05:04:27,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:04:27,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 05:04:27,070 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-12-09 05:04:27,070 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [4], [6], [9], [11], [13], [16], [19], [22], [25], [27], [46], [49], [52], [55], [58], [60], [64], [67], [70], [72], [75], [83], [116], [119], [121], [124], [127], [128], [129], [130], [133], [138], [141], [145], [150], [152], [155], [163], [165], [167], [169], [170], [174], [175], [179], [181], [182], [184], [185], [189], [191], [192], [193], [194], [195], [197], [198], [199], [201], [202], [203], [204], [205], [207], [208], [211], [217], [218], [222], [235], [237], [238], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [251], [252], [253], [254], [255], [256], [259], [260], [261], [262], [267], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [287], [288], [289], [293], [294], [295], [296] [2018-12-09 05:04:27,072 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 05:04:27,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 05:04:27,799 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 05:04:27,799 INFO L272 AbstractInterpreter]: Visited 120 different actions 539 times. Merged at 27 different actions 115 times. Widened at 2 different actions 3 times. Performed 15509 root evaluator evaluations with a maximum evaluation depth of 10. Performed 15509 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 20 fixpoints after 8 different actions. Largest state had 131 variables. [2018-12-09 05:04:27,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:04:27,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 05:04:27,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:04:27,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:04:27,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:04:27,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 05:04:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:04:27,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:04:27,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 152 [2018-12-09 05:04:27,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,006 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-12-09 05:04:28,221 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-12-09 05:04:28,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,229 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-12-09 05:04:28,338 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-09 05:04:28,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,357 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-12-09 05:04:28,493 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-09 05:04:28,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,513 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,532 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-12-09 05:04:28,786 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-12-09 05:04:28,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,814 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-12-09 05:04:28,976 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-09 05:04:28,980 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,982 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,989 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:28,992 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-12-09 05:04:29,097 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-09 05:04:29,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,112 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-12-09 05:04:29,117 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-12-09 05:04:29,118 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 05:04:29,169 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:29,221 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:29,271 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:29,325 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:29,378 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:29,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:29,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,574 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-12-09 05:04:29,870 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-12-09 05:04:29,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:29,925 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-12-09 05:04:30,225 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2018-12-09 05:04:30,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,247 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-12-09 05:04:30,350 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-09 05:04:30,356 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,373 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-12-09 05:04:30,487 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-09 05:04:30,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,500 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,505 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,506 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-12-09 05:04:30,610 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-09 05:04:30,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,626 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-12-09 05:04:30,631 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-12-09 05:04:30,632 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 05:04:30,692 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:30,742 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:30,794 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:30,852 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:30,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:30,983 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,004 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-12-09 05:04:31,375 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-12-09 05:04:31,381 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,397 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-12-09 05:04:31,515 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-12-09 05:04:31,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,525 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,535 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-12-09 05:04:31,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,638 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-12-09 05:04:31,642 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-12-09 05:04:31,643 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-09 05:04:31,694 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:31,743 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:31,800 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:31,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,916 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,932 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,935 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:31,949 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-12-09 05:04:32,267 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-12-09 05:04:32,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,281 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,286 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-12-09 05:04:32,422 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-09 05:04:32,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,429 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,430 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,435 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,439 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,440 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-12-09 05:04:32,445 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-12-09 05:04:32,446 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-09 05:04:32,501 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:32,557 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:32,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,672 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:32,710 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-12-09 05:04:33,076 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2018-12-09 05:04:33,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,119 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,136 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-12-09 05:04:33,141 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-12-09 05:04:33,142 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 05:04:33,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,351 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-12-09 05:04:33,352 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-12-09 05:04:33,628 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 05:04:33,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,971 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:33,980 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-12-09 05:04:33,985 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-12-09 05:04:33,985 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 05:04:34,050 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:34,386 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-09 05:04:34,739 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-09 05:04:35,136 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-09 05:04:35,660 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-09 05:04:36,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,418 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-12-09 05:04:36,530 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-09 05:04:36,536 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,552 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-12-09 05:04:36,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,608 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,614 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-12-09 05:04:36,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,687 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,688 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-12-09 05:04:36,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,773 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,776 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,780 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:36,782 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-12-09 05:04:36,786 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-12-09 05:04:36,786 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-09 05:04:36,836 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:36,884 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:36,936 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:36,989 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:37,047 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:04:37,598 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-12-09 05:04:38,351 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-09 05:04:38,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-09 05:04:39,622 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-12-09 05:04:39,622 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 8 variables, input treesize:188, output treesize:1539 [2018-12-09 05:04:49,474 WARN L180 SmtUtils]: Spent 9.78 s on a formula simplification. DAG size of input: 707 DAG size of output: 257 [2018-12-09 05:04:57,488 WARN L180 SmtUtils]: Spent 2.30 s on a formula simplification that was a NOOP. DAG size: 257 [2018-12-09 05:04:58,086 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 286 [2018-12-09 05:04:58,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,100 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 54 disjoint index pairs (out of 55 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 366 [2018-12-09 05:04:58,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 360 treesize of output 352 [2018-12-09 05:04:58,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:04:58,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:04:58,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 55 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 330 [2018-12-09 05:04:58,675 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 05:04:59,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 05:05:00,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,196 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:00,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 266 [2018-12-09 05:05:00,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 240 [2018-12-09 05:05:00,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:00,334 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:01,121 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,125 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,126 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,132 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 05:05:01,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 333 [2018-12-09 05:05:01,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 237 [2018-12-09 05:05:01,142 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:01,328 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:02,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 3 dim-1 vars, End of recursive call: 34 dim-0 vars, and 5 xjuncts. [2018-12-09 05:05:02,299 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 23 variables, input treesize:594, output treesize:1270 [2018-12-09 05:05:08,491 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 05:05:08,692 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:05:08,693 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:621) 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:187) 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.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) 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) ... 45 more [2018-12-09 05:05:08,698 INFO L168 Benchmark]: Toolchain (without parser) took 47795.09 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 901.3 MB). Free memory was 946.2 MB in the beginning and 1.6 GB in the end (delta: -624.7 MB). Peak memory consumption was 276.6 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:08,699 INFO L168 Benchmark]: CDTParser took 0.11 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-12-09 05:05:08,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 946.2 MB in the beginning and 1.0 GB in the end (delta: -88.9 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:08,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:05:08,700 INFO L168 Benchmark]: Boogie Preprocessor took 30.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:08,700 INFO L168 Benchmark]: RCFGBuilder took 380.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 975.1 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:08,701 INFO L168 Benchmark]: TraceAbstraction took 46645.33 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 803.7 MB). Free memory was 975.1 MB in the beginning and 1.6 GB in the end (delta: -595.8 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:08,702 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.11 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 712.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.5 MB). Free memory was 946.2 MB in the beginning and 1.0 GB in the end (delta: -88.9 MB). Peak memory consumption was 104.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 380.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 975.1 MB in the end (delta: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46645.33 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 803.7 MB). Free memory was 975.1 MB in the beginning and 1.6 GB in the end (delta: -595.8 MB). Peak memory consumption was 207.9 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-635dfa2 [2018-12-09 05:05:09,759 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:05:09,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:05:09,766 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:05:09,766 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:05:09,767 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:05:09,767 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:05:09,768 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:05:09,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:05:09,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:05:09,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:05:09,770 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:05:09,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:05:09,771 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:05:09,771 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:05:09,772 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:05:09,772 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:05:09,773 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:05:09,774 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:05:09,775 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:05:09,775 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:05:09,776 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:05:09,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:05:09,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:05:09,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:05:09,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:05:09,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:05:09,778 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:05:09,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:05:09,779 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:05:09,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:05:09,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:05:09,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:05:09,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:05:09,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:05:09,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:05:09,781 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf [2018-12-09 05:05:09,788 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:05:09,789 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:05:09,789 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 05:05:09,789 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 05:05:09,789 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 05:05:09,789 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 05:05:09,789 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 05:05:09,790 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 05:05:09,790 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 05:05:09,790 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 05:05:09,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:05:09,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:05:09,790 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 05:05:09,790 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:05:09,790 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 05:05:09,791 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 05:05:09,791 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 05:05:09,791 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 05:05:09,791 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:05:09,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 05:05:09,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:05:09,791 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 05:05:09,791 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:05:09,791 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 05:05:09,791 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:05:09,791 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:05:09,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:05:09,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 05:05:09,792 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 05:05:09,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:05:09,792 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 05:05:09,792 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 05:05:09,792 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af2001ab830213f8cdb559c777be1d107ce8fe72 [2018-12-09 05:05:09,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:05:09,820 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:05:09,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:05:09,824 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:05:09,824 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:05:09,825 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/../../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-12-09 05:05:09,861 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data/c31fd46e7/d204b41c95ff4380822b8f91d83540ff/FLAGb2bfa8d5e [2018-12-09 05:05:10,378 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:05:10,379 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/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-12-09 05:05:10,394 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data/c31fd46e7/d204b41c95ff4380822b8f91d83540ff/FLAGb2bfa8d5e [2018-12-09 05:05:10,898 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/data/c31fd46e7/d204b41c95ff4380822b8f91d83540ff [2018-12-09 05:05:10,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:05:10,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:05:10,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:05:10,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:05:10,905 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:05:10,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:05:10" (1/1) ... [2018-12-09 05:05:10,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3de69a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:10, skipping insertion in model container [2018-12-09 05:05:10,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:05:10" (1/1) ... [2018-12-09 05:05:10,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:05:10,960 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:05:11,480 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:05:11,497 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:05:11,595 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:05:11,618 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:05:11,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11 WrapperNode [2018-12-09 05:05:11,619 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:05:11,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:05:11,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:05:11,619 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:05:11,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... [2018-12-09 05:05:11,637 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... [2018-12-09 05:05:11,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:05:11,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:05:11,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:05:11,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:05:11,649 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... [2018-12-09 05:05:11,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... [2018-12-09 05:05:11,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... [2018-12-09 05:05:11,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... [2018-12-09 05:05:11,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... [2018-12-09 05:05:11,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... [2018-12-09 05:05:11,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... [2018-12-09 05:05:11,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:05:11,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:05:11,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:05:11,677 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:05:11,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 05:05:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-12-09 05:05:11,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-12-09 05:05:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 05:05:11,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 05:05:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-12-09 05:05:11,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-12-09 05:05:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:05:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 05:05:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-12-09 05:05:11,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-12-09 05:05:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-09 05:05:11,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-12-09 05:05:11,710 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-12-09 05:05:11,710 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-12-09 05:05:11,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-12-09 05:05:11,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-12-09 05:05:11,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2018-12-09 05:05:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-12-09 05:05:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-12-09 05:05:11,711 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-12-09 05:05:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-12-09 05:05:11,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-12-09 05:05:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-12-09 05:05:11,711 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-12-09 05:05:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-12-09 05:05:11,711 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-12-09 05:05:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-09 05:05:11,711 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-09 05:05:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-12-09 05:05:11,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-12-09 05:05:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 05:05:11,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 05:05:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-12-09 05:05:11,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-12-09 05:05:11,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-09 05:05:11,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-09 05:05:11,712 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-12-09 05:05:11,712 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-12-09 05:05:11,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:05:11,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:05:11,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-12-09 05:05:11,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-12-09 05:05:12,156 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:05:12,156 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 05:05:12,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:05:12 BoogieIcfgContainer [2018-12-09 05:05:12,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:05:12,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 05:05:12,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 05:05:12,160 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 05:05:12,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 05:05:10" (1/3) ... [2018-12-09 05:05:12,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381570e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:05:12, skipping insertion in model container [2018-12-09 05:05:12,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:05:11" (2/3) ... [2018-12-09 05:05:12,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@381570e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 05:05:12, skipping insertion in model container [2018-12-09 05:05:12,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:05:12" (3/3) ... [2018-12-09 05:05:12,162 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-12-09 05:05:12,168 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 05:05:12,173 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 05:05:12,182 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 05:05:12,202 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 05:05:12,202 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 05:05:12,202 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 05:05:12,202 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 05:05:12,202 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 05:05:12,202 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 05:05:12,203 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 05:05:12,203 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 05:05:12,203 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 05:05:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-09 05:05:12,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 05:05:12,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:12,222 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-12-09 05:05:12,223 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:12,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:12,227 INFO L82 PathProgramCache]: Analyzing trace with hash 250893536, now seen corresponding path program 1 times [2018-12-09 05:05:12,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:12,231 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 05:05:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:12,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 05:05:12,475 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:05:12,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:12,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:05:12,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:05:12,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:05:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:05:12,495 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-09 05:05:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:12,548 INFO L93 Difference]: Finished difference Result 327 states and 419 transitions. [2018-12-09 05:05:12,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:05:12,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-09 05:05:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:12,558 INFO L225 Difference]: With dead ends: 327 [2018-12-09 05:05:12,558 INFO L226 Difference]: Without dead ends: 200 [2018-12-09 05:05:12,560 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-12-09 05:05:12,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-09 05:05:12,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-12-09 05:05:12,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-09 05:05:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 241 transitions. [2018-12-09 05:05:12,597 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 241 transitions. Word has length 69 [2018-12-09 05:05:12,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:12,598 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 241 transitions. [2018-12-09 05:05:12,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:05:12,598 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 241 transitions. [2018-12-09 05:05:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-09 05:05:12,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:12,600 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-12-09 05:05:12,600 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:12,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash 469035080, now seen corresponding path program 1 times [2018-12-09 05:05:12,601 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:12,601 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 05:05:12,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:12,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 05:05:12,790 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:05:12,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:12,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:05:12,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:05:12,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:05:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:05:12,793 INFO L87 Difference]: Start difference. First operand 197 states and 241 transitions. Second operand 3 states. [2018-12-09 05:05:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:12,842 INFO L93 Difference]: Finished difference Result 423 states and 525 transitions. [2018-12-09 05:05:12,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:05:12,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-12-09 05:05:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:12,844 INFO L225 Difference]: With dead ends: 423 [2018-12-09 05:05:12,845 INFO L226 Difference]: Without dead ends: 260 [2018-12-09 05:05:12,846 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-12-09 05:05:12,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-09 05:05:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 247. [2018-12-09 05:05:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-09 05:05:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2018-12-09 05:05:12,866 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 88 [2018-12-09 05:05:12,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:12,866 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2018-12-09 05:05:12,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:05:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2018-12-09 05:05:12,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 05:05:12,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:12,869 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-12-09 05:05:12,869 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:12,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:12,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1305361854, now seen corresponding path program 1 times [2018-12-09 05:05:12,870 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:12,871 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 05:05:12,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:13,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:13,081 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-12-09 05:05:13,085 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-12-09 05:05:13,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:13,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:13,107 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-12-09 05:05:13,110 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-12-09 05:05:13,110 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 05:05:13,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:13,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:05:13,116 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:7 [2018-12-09 05:05:13,143 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 05:05:13,143 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:05:13,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:13,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 05:05:13,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 05:05:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 05:05:13,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 05:05:13,146 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand 5 states. [2018-12-09 05:05:13,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:13,315 INFO L93 Difference]: Finished difference Result 470 states and 592 transitions. [2018-12-09 05:05:13,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 05:05:13,316 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-09 05:05:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:13,318 INFO L225 Difference]: With dead ends: 470 [2018-12-09 05:05:13,318 INFO L226 Difference]: Without dead ends: 257 [2018-12-09 05:05:13,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:05:13,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-09 05:05:13,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-12-09 05:05:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-09 05:05:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 314 transitions. [2018-12-09 05:05:13,332 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 314 transitions. Word has length 107 [2018-12-09 05:05:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:13,333 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 314 transitions. [2018-12-09 05:05:13,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 05:05:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 314 transitions. [2018-12-09 05:05:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-09 05:05:13,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:13,334 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-12-09 05:05:13,334 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:13,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:13,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1603402048, now seen corresponding path program 1 times [2018-12-09 05:05:13,335 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:13,335 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/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-12-09 05:05:13,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:13,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-09 05:05:13,748 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:05:13,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:13,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 05:05:13,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 05:05:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 05:05:13,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 05:05:13,753 INFO L87 Difference]: Start difference. First operand 254 states and 314 transitions. Second operand 6 states. [2018-12-09 05:05:13,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:13,841 INFO L93 Difference]: Finished difference Result 492 states and 612 transitions. [2018-12-09 05:05:13,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 05:05:13,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-12-09 05:05:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:13,843 INFO L225 Difference]: With dead ends: 492 [2018-12-09 05:05:13,843 INFO L226 Difference]: Without dead ends: 255 [2018-12-09 05:05:13,844 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-12-09 05:05:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-09 05:05:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-12-09 05:05:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-09 05:05:13,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 315 transitions. [2018-12-09 05:05:13,851 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 315 transitions. Word has length 107 [2018-12-09 05:05:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:13,852 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 315 transitions. [2018-12-09 05:05:13,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 05:05:13,852 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 315 transitions. [2018-12-09 05:05:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-09 05:05:13,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:13,853 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-12-09 05:05:13,853 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:13,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:13,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1129967362, now seen corresponding path program 1 times [2018-12-09 05:05:13,853 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:13,854 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 05:05:13,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:14,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:14,258 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 05:05:14,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 05:05:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 05:05:14,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:05:14,425 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:05:14,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:14,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:14,624 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 05:05:14,624 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:05:14,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:05:14,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2018-12-09 05:05:14,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 05:05:14,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 05:05:14,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-09 05:05:14,642 INFO L87 Difference]: Start difference. First operand 255 states and 315 transitions. Second operand 16 states. [2018-12-09 05:05:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:14,924 INFO L93 Difference]: Finished difference Result 512 states and 639 transitions. [2018-12-09 05:05:14,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 05:05:14,924 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-12-09 05:05:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:14,925 INFO L225 Difference]: With dead ends: 512 [2018-12-09 05:05:14,925 INFO L226 Difference]: Without dead ends: 274 [2018-12-09 05:05:14,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-09 05:05:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-09 05:05:14,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2018-12-09 05:05:14,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-09 05:05:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 322 transitions. [2018-12-09 05:05:14,933 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 322 transitions. Word has length 109 [2018-12-09 05:05:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:14,933 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 322 transitions. [2018-12-09 05:05:14,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 05:05:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 322 transitions. [2018-12-09 05:05:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 05:05:14,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:14,934 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-12-09 05:05:14,934 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:14,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:14,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1649188542, now seen corresponding path program 1 times [2018-12-09 05:05:14,935 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:14,935 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 05:05:14,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:15,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 05:05:15,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:05:15,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:15,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:05:15,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:05:15,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:05:15,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:05:15,078 INFO L87 Difference]: Start difference. First operand 263 states and 322 transitions. Second operand 3 states. [2018-12-09 05:05:15,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:15,091 INFO L93 Difference]: Finished difference Result 481 states and 600 transitions. [2018-12-09 05:05:15,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:05:15,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-09 05:05:15,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:15,092 INFO L225 Difference]: With dead ends: 481 [2018-12-09 05:05:15,093 INFO L226 Difference]: Without dead ends: 254 [2018-12-09 05:05:15,093 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-12-09 05:05:15,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-09 05:05:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2018-12-09 05:05:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-09 05:05:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 305 transitions. [2018-12-09 05:05:15,100 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 305 transitions. Word has length 111 [2018-12-09 05:05:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:15,100 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 305 transitions. [2018-12-09 05:05:15,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:05:15,100 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 305 transitions. [2018-12-09 05:05:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 05:05:15,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:15,101 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-12-09 05:05:15,101 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:15,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:15,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1486664420, now seen corresponding path program 1 times [2018-12-09 05:05:15,102 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:15,102 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/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-12-09 05:05:15,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:15,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:15,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 05:05:15,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 05:05:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 05:05:15,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:05:15,785 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:05:15,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:15,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 05:05:16,023 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:05:16,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 05:05:16,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 17 [2018-12-09 05:05:16,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 05:05:16,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 05:05:16,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-09 05:05:16,041 INFO L87 Difference]: Start difference. First operand 248 states and 305 transitions. Second operand 17 states. [2018-12-09 05:05:17,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:17,297 INFO L93 Difference]: Finished difference Result 725 states and 899 transitions. [2018-12-09 05:05:17,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 05:05:17,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 117 [2018-12-09 05:05:17,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:17,300 INFO L225 Difference]: With dead ends: 725 [2018-12-09 05:05:17,300 INFO L226 Difference]: Without dead ends: 484 [2018-12-09 05:05:17,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-12-09 05:05:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-12-09 05:05:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 280. [2018-12-09 05:05:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-09 05:05:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 337 transitions. [2018-12-09 05:05:17,310 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 337 transitions. Word has length 117 [2018-12-09 05:05:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:17,310 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 337 transitions. [2018-12-09 05:05:17,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 05:05:17,310 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 337 transitions. [2018-12-09 05:05:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 05:05:17,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:17,311 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-12-09 05:05:17,311 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:17,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:17,311 INFO L82 PathProgramCache]: Analyzing trace with hash 255289994, now seen corresponding path program 1 times [2018-12-09 05:05:17,312 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:17,312 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 05:05:17,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:17,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 05:05:17,442 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:05:17,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:17,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 05:05:17,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 05:05:17,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 05:05:17,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 05:05:17,444 INFO L87 Difference]: Start difference. First operand 280 states and 337 transitions. Second operand 3 states. [2018-12-09 05:05:17,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:17,455 INFO L93 Difference]: Finished difference Result 416 states and 503 transitions. [2018-12-09 05:05:17,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 05:05:17,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-12-09 05:05:17,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:17,457 INFO L225 Difference]: With dead ends: 416 [2018-12-09 05:05:17,457 INFO L226 Difference]: Without dead ends: 289 [2018-12-09 05:05:17,457 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-12-09 05:05:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-09 05:05:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 280. [2018-12-09 05:05:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-09 05:05:17,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2018-12-09 05:05:17,465 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 128 [2018-12-09 05:05:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:17,465 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2018-12-09 05:05:17,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 05:05:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2018-12-09 05:05:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-09 05:05:17,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:17,466 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-12-09 05:05:17,466 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:17,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:17,466 INFO L82 PathProgramCache]: Analyzing trace with hash 121276488, now seen corresponding path program 1 times [2018-12-09 05:05:17,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:17,466 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/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-12-09 05:05:17,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:17,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 05:05:17,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 05:05:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-09 05:05:18,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 05:05:18,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 05:05:18,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:18,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-09 05:05:18,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 05:05:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-09 05:05:18,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-12-09 05:05:18,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9, 8] total 26 [2018-12-09 05:05:18,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 05:05:18,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 05:05:18,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-12-09 05:05:18,662 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand 26 states. [2018-12-09 05:05:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:19,400 INFO L93 Difference]: Finished difference Result 740 states and 901 transitions. [2018-12-09 05:05:19,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 05:05:19,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 128 [2018-12-09 05:05:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:19,402 INFO L225 Difference]: With dead ends: 740 [2018-12-09 05:05:19,402 INFO L226 Difference]: Without dead ends: 477 [2018-12-09 05:05:19,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 486 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2018-12-09 05:05:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-09 05:05:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 462. [2018-12-09 05:05:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-12-09 05:05:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 551 transitions. [2018-12-09 05:05:19,414 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 551 transitions. Word has length 128 [2018-12-09 05:05:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:19,414 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 551 transitions. [2018-12-09 05:05:19,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 05:05:19,414 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 551 transitions. [2018-12-09 05:05:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-09 05:05:19,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 05:05:19,415 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-12-09 05:05:19,415 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 05:05:19,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:05:19,415 INFO L82 PathProgramCache]: Analyzing trace with hash 810441938, now seen corresponding path program 1 times [2018-12-09 05:05:19,416 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 05:05:19,416 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 05:05:19,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 05:05:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:05:20,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:05:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-09 05:05:21,261 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 05:05:21,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 05:05:21,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 05:05:21,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 05:05:21,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 05:05:21,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-09 05:05:21,267 INFO L87 Difference]: Start difference. First operand 462 states and 551 transitions. Second operand 14 states. [2018-12-09 05:05:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 05:05:26,386 INFO L93 Difference]: Finished difference Result 651 states and 782 transitions. [2018-12-09 05:05:26,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 05:05:26,387 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2018-12-09 05:05:26,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 05:05:26,388 INFO L225 Difference]: With dead ends: 651 [2018-12-09 05:05:26,388 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 05:05:26,388 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-12-09 05:05:26,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 05:05:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 05:05:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 05:05:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 05:05:26,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-12-09 05:05:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 05:05:26,389 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 05:05:26,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 05:05:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 05:05:26,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 05:05:26,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 05:05:26,678 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-12-09 05:05:27,304 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2018-12-09 05:05:27,467 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-12-09 05:05:27,631 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2018-12-09 05:05:27,807 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2018-12-09 05:05:28,062 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 7 [2018-12-09 05:05:28,343 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-09 05:05:28,510 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 20 [2018-12-09 05:05:28,685 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 14 [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-12-09 05:05:28,688 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L451 ceAbstractionStarter]: At program point ldv_undef_intENTRY(lines 5900 5907) the Hoare annotation is: true [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point ldv_undef_intFINAL(lines 5900 5907) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point ldv_undef_intEXIT(lines 5900 5907) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 6151 6238) no Hoare annotation was computed. [2018-12-09 05:05:28,688 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-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point L6163-1(line 6163) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point L6229(line 6229) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L451 ceAbstractionStarter]: At program point L6188(line 6188) the Hoare annotation is: true [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point L6180(line 6180) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L451 ceAbstractionStarter]: At program point L6230(line 6230) the Hoare annotation is: true [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point L6197(lines 6197 6224) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point L6222(line 6222) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point L6181(lines 6181 6185) no Hoare annotation was computed. [2018-12-09 05:05:28,688 INFO L448 ceAbstractionStarter]: For program point L6206(line 6206) no Hoare annotation was computed. [2018-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6198(line 6198) no Hoare annotation was computed. [2018-12-09 05:05:28,689 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-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6165-1(line 6165) no Hoare annotation was computed. [2018-12-09 05:05:28,689 INFO L451 ceAbstractionStarter]: At program point L6223(line 6223) the Hoare annotation is: true [2018-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 6151 6238) no Hoare annotation was computed. [2018-12-09 05:05:28,689 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-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6182-1(line 6182) no Hoare annotation was computed. [2018-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6207(lines 6207 6220) no Hoare annotation was computed. [2018-12-09 05:05:28,689 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-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6199(lines 6199 6204) no Hoare annotation was computed. [2018-12-09 05:05:28,689 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-12-09 05:05:28,689 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-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6208-1(line 6208) no Hoare annotation was computed. [2018-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6175(lines 6175 6231) no Hoare annotation was computed. [2018-12-09 05:05:28,689 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-12-09 05:05:28,689 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-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6200-1(line 6200) no Hoare annotation was computed. [2018-12-09 05:05:28,689 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-12-09 05:05:28,689 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-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6209-2(lines 6207 6219) no Hoare annotation was computed. [2018-12-09 05:05:28,689 INFO L448 ceAbstractionStarter]: For program point L6209(lines 6209 6213) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6176(line 6176) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6168(line 6168) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6177(lines 6177 6192) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6235(line 6235) no Hoare annotation was computed. [2018-12-09 05:05:28,690 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-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6169-1(line 6169) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6194(line 6194) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6195(lines 6195 6227) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6187(line 6187) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6179(lines 6179 6189) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L451 ceAbstractionStarter]: At program point L5886(line 5886) the Hoare annotation is: true [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point ldv_init_zallocFINAL(lines 5881 5891) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L5886-1(line 5886) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point ldv_init_zallocEXIT(lines 5881 5891) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L451 ceAbstractionStarter]: At program point ldv_init_zallocENTRY(lines 5881 5891) the Hoare annotation is: true [2018-12-09 05:05:28,690 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-12-09 05:05:28,690 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-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6315(lines 6315 6320) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6313(lines 6313 6322) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point L6314-1(line 6314) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 6309 6325) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 6309 6325) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L448 ceAbstractionStarter]: For program point pppox_initFINAL(lines 6133 6140) no Hoare annotation was computed. [2018-12-09 05:05:28,690 INFO L451 ceAbstractionStarter]: At program point pppox_initENTRY(lines 6133 6140) the Hoare annotation is: true [2018-12-09 05:05:28,691 INFO L451 ceAbstractionStarter]: At program point L6137(line 6137) the Hoare annotation is: true [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point L6137-1(line 6137) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point pppox_initEXIT(lines 6133 6140) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L451 ceAbstractionStarter]: At program point sock_unregisterENTRY(lines 6391 6393) the Hoare annotation is: true [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point sock_unregisterEXIT(lines 6391 6393) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point sock_unregisterFINAL(lines 6391 6393) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTFINAL(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L451 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTENTRY(line -1) the Hoare annotation is: true [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTEXIT(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6259) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point ldv_errorFINAL(lines 6255 6261) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L451 ceAbstractionStarter]: At program point ldv_errorENTRY(lines 6255 6261) the Hoare annotation is: true [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point ldv_errorEXIT(lines 6255 6261) no Hoare annotation was computed. [2018-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_5EXIT(lines 6239 6246) no Hoare annotation was computed. [2018-12-09 05:05:28,691 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-12-09 05:05:28,691 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_5FINAL(lines 6239 6246) no Hoare annotation was computed. [2018-12-09 05:05:28,691 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-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6243-1(line 6243) no Hoare annotation was computed. [2018-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2018-12-09 05:05:28,692 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-12-09 05:05:28,692 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-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point pppox_createFINAL(lines 6096 6131) no Hoare annotation was computed. [2018-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6126-1(line 6126) no Hoare annotation was computed. [2018-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6116-2(lines 6114 6125) no Hoare annotation was computed. [2018-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6116(lines 6116 6120) no Hoare annotation was computed. [2018-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6112(lines 6112 6125) no Hoare annotation was computed. [2018-12-09 05:05:28,692 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-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6108-2(lines 6108 6111) no Hoare annotation was computed. [2018-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2018-12-09 05:05:28,692 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-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6127-1(line 6127) no Hoare annotation was computed. [2018-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point pppox_createEXIT(lines 6096 6131) no Hoare annotation was computed. [2018-12-09 05:05:28,692 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-12-09 05:05:28,692 INFO L448 ceAbstractionStarter]: For program point L6115-1(line 6115) no Hoare annotation was computed. [2018-12-09 05:05:28,692 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 6354 6363) the Hoare annotation is: true [2018-12-09 05:05:28,692 INFO L444 ceAbstractionStarter]: At program point L6358(line 6358) the Hoare annotation is: (not (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 6354 6363) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point L6357(lines 6354 6363) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point ldv_stopFINAL(lines 5924 5930) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point ldv_stopEXIT(lines 5924 5930) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L451 ceAbstractionStarter]: At program point ldv_stopENTRY(lines 5924 5930) the Hoare annotation is: true [2018-12-09 05:05:28,693 INFO L451 ceAbstractionStarter]: At program point sock_registerENTRY(lines 6388 6390) the Hoare annotation is: true [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point sock_registerEXIT(lines 6388 6390) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point sock_registerFINAL(lines 6388 6390) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,693 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-12-09 05:05:28,693 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L451 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 6371 6373) the Hoare annotation is: true [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 6371 6373) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point L6330(lines 6330 6333) no Hoare annotation was computed. [2018-12-09 05:05:28,693 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-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point L6329-2(lines 6326 6339) no Hoare annotation was computed. [2018-12-09 05:05:28,693 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-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point L6329(lines 6329 6336) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point L6330-1(lines 6330 6333) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 6326 6339) no Hoare annotation was computed. [2018-12-09 05:05:28,693 INFO L448 ceAbstractionStarter]: For program point ldv_memsetFINAL(lines 5892 5899) no Hoare annotation was computed. [2018-12-09 05:05:28,694 INFO L448 ceAbstractionStarter]: For program point L5896-1(line 5896) no Hoare annotation was computed. [2018-12-09 05:05:28,694 INFO L451 ceAbstractionStarter]: At program point ldv_memsetENTRY(lines 5892 5899) the Hoare annotation is: true [2018-12-09 05:05:28,694 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-12-09 05:05:28,694 INFO L448 ceAbstractionStarter]: For program point ldv_memsetEXIT(lines 5892 5899) no Hoare annotation was computed. [2018-12-09 05:05:28,694 INFO L451 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-12-09 05:05:28,694 INFO L448 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,694 INFO L448 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-12-09 05:05:28,694 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_6EXIT(lines 6247 6253) no Hoare annotation was computed. [2018-12-09 05:05:28,694 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-12-09 05:05:28,694 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-12-09 05:05:28,694 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_6FINAL(lines 6247 6253) no Hoare annotation was computed. [2018-12-09 05:05:28,694 INFO L448 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 6141 6147) no Hoare annotation was computed. [2018-12-09 05:05:28,694 INFO L451 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 6141 6147) the Hoare annotation is: true [2018-12-09 05:05:28,694 INFO L448 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 6141 6147) no Hoare annotation was computed. [2018-12-09 05:05:28,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 05:05:28 BoogieIcfgContainer [2018-12-09 05:05:28,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 05:05:28,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:05:28,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:05:28,701 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:05:28,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:05:12" (3/4) ... [2018-12-09 05:05:28,703 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 05:05:28,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-12-09 05:05:28,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2018-12-09 05:05:28,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 05:05:28,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2018-12-09 05:05:28,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-12-09 05:05:28,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-12-09 05:05:28,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_unregister [2018-12-09 05:05:28,707 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_5 [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_register [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_initialize [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_6 [2018-12-09 05:05:28,708 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-12-09 05:05:28,712 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2018-12-09 05:05:28,713 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-12-09 05:05:28,713 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-12-09 05:05:28,713 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 05:05:28,713 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-09 05:05:28,729 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-12-09 05:05:28,729 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-12-09 05:05:28,730 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1bv32 == \old(ldv_module_refcounter)) || 1bv32 == ldv_module_refcounter [2018-12-09 05:05:28,749 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_860e170e-0f2a-4e0c-92ba-d2bf15015f9a/bin-2019/utaipan/witness.graphml [2018-12-09 05:05:28,749 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:05:28,749 INFO L168 Benchmark]: Toolchain (without parser) took 17848.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 932.6 MB in the beginning and 823.8 MB in the end (delta: 108.8 MB). Peak memory consumption was 426.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:28,750 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:05:28,750 INFO L168 Benchmark]: CACSL2BoogieTranslator took 717.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:28,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.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: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:28,750 INFO L168 Benchmark]: Boogie Preprocessor took 33.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: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:28,750 INFO L168 Benchmark]: RCFGBuilder took 480.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:28,750 INFO L168 Benchmark]: TraceAbstraction took 16543.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.0 GB in the beginning and 832.7 MB in the end (delta: 187.2 MB). Peak memory consumption was 359.2 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:28,750 INFO L168 Benchmark]: Witness Printer took 47.93 ms. Allocated memory is still 1.3 GB. Free memory was 832.7 MB in the beginning and 823.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:05:28,751 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 717.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -152.6 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.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: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.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: 5.5 MB). Peak memory consumption was 5.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 480.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.3 MB). Peak memory consumption was 54.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16543.01 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.0 MB). Free memory was 1.0 GB in the beginning and 832.7 MB in the end (delta: 187.2 MB). Peak memory consumption was 359.2 MB. Max. memory is 11.5 GB. * Witness Printer took 47.93 ms. Allocated memory is still 1.3 GB. Free memory was 832.7 MB in the beginning and 823.8 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 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, 16.4s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 7.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1675 SDtfs, 777 SDslu, 9938 SDs, 0 SdLazy, 1835 SolverSat, 165 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1968 GetRequests, 1855 SyntacticMatches, 5 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462occurred in iteration=9, 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, 10 MinimizatonAttempts, 264 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 49 LocationsWithAnnotation, 542 PreInvPairs, 593 NumberOfFragments, 824 HoareAnnotationTreeSize, 542 FomulaSimplifications, 6498 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 49 FomulaSimplificationsInter, 5707 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1463 NumberOfCodeBlocks, 1463 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1928 ConstructedInterpolants, 12 QuantifiedInterpolants, 458402 SizeOfPredicates, 43 NumberOfNonLiveVariables, 7146 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 542/611 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...