./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_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 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-08 20:21:29,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:21:29,749 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:21:29,755 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:21:29,756 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:21:29,756 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:21:29,757 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:21:29,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:21:29,759 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:21:29,759 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:21:29,760 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:21:29,760 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:21:29,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:21:29,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:21:29,761 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:21:29,762 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:21:29,762 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:21:29,763 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:21:29,764 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:21:29,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:21:29,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:21:29,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:21:29,767 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:21:29,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:21:29,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:21:29,768 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:21:29,769 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:21:29,769 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:21:29,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:21:29,770 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:21:29,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:21:29,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:21:29,771 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:21:29,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:21:29,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:21:29,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:21:29,772 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-12-08 20:21:29,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:21:29,779 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:21:29,780 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:21:29,780 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:21:29,780 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:21:29,780 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:21:29,780 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:21:29,780 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:21:29,780 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 20:21:29,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:21:29,781 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:21:29,781 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:21:29,781 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:21:29,781 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:21:29,781 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:21:29,781 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:21:29,781 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:21:29,781 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:21:29,781 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:21:29,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:21:29,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:21:29,782 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:21:29,782 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:21:29,782 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:21:29,782 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 20:21:29,782 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:21:29,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 20:21:29,782 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 20:21:29,782 INFO L133 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af2001ab830213f8cdb559c777be1d107ce8fe72 [2018-12-08 20:21:29,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:21:29,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:21:29,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:21:29,809 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:21:29,810 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:21:29,810 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i [2018-12-08 20:21:29,845 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data/7759f485a/b1a136a1df8341e49c04217d3459a60e/FLAGe7bfc6cf0 [2018-12-08 20:21:30,425 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:21:30,426 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/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-08 20:21:30,441 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data/7759f485a/b1a136a1df8341e49c04217d3459a60e/FLAGe7bfc6cf0 [2018-12-08 20:21:30,879 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data/7759f485a/b1a136a1df8341e49c04217d3459a60e [2018-12-08 20:21:30,881 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:21:30,882 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:21:30,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:21:30,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:21:30,885 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:21:30,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:21:30" (1/1) ... [2018-12-08 20:21:30,887 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eb7c602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:30, skipping insertion in model container [2018-12-08 20:21:30,888 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:21:30" (1/1) ... [2018-12-08 20:21:30,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:21:30,932 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:21:31,430 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:21:31,445 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:21:31,536 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:21:31,556 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:21:31,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31 WrapperNode [2018-12-08 20:21:31,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:21:31,557 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:21:31,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:21:31,557 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:21:31,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... [2018-12-08 20:21:31,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... [2018-12-08 20:21:31,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:21:31,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:21:31,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:21:31,581 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:21:31,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... [2018-12-08 20:21:31,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... [2018-12-08 20:21:31,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... [2018-12-08 20:21:31,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... [2018-12-08 20:21:31,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... [2018-12-08 20:21:31,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... [2018-12-08 20:21:31,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... [2018-12-08 20:21:31,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:21:31,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:21:31,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:21:31,611 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:21:31,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:21:31,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-12-08 20:21:31,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-12-08 20:21:31,651 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 20:21:31,651 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 20:21:31,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-12-08 20:21:31,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-12-08 20:21:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 20:21:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-12-08 20:21:31,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-12-08 20:21:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-08 20:21:31,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-08 20:21:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 20:21:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-12-08 20:21:31,652 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-12-08 20:21:31,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 20:21:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-12-08 20:21:31,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-12-08 20:21:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-12-08 20:21:31,653 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-12-08 20:21:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-12-08 20:21:31,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-12-08 20:21:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-12-08 20:21:31,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-12-08 20:21:31,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 20:21:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 20:21:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-12-08 20:21:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-12-08 20:21:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-12-08 20:21:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-12-08 20:21:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-12-08 20:21:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-12-08 20:21:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-12-08 20:21:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-12-08 20:21:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-08 20:21:31,654 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-08 20:21:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-12-08 20:21:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-12-08 20:21:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 20:21:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 20:21:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 20:21:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-12-08 20:21:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-12-08 20:21:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-08 20:21:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-08 20:21:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-12-08 20:21:31,656 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-12-08 20:21:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:21:31,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:21:31,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-12-08 20:21:31,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-12-08 20:21:32,032 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:21:32,032 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 20:21:32,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:21:32 BoogieIcfgContainer [2018-12-08 20:21:32,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:21:32,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:21:32,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:21:32,036 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:21:32,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:21:30" (1/3) ... [2018-12-08 20:21:32,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a90c044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:21:32, skipping insertion in model container [2018-12-08 20:21:32,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:21:31" (2/3) ... [2018-12-08 20:21:32,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a90c044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:21:32, skipping insertion in model container [2018-12-08 20:21:32,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:21:32" (3/3) ... [2018-12-08 20:21:32,039 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-08 20:21:32,047 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:21:32,053 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 20:21:32,066 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 20:21:32,084 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:21:32,085 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:21:32,085 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 20:21:32,085 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:21:32,085 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:21:32,085 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:21:32,085 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:21:32,085 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:21:32,085 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:21:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-08 20:21:32,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 20:21:32,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:32,103 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-08 20:21:32,105 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:32,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:32,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1050314844, now seen corresponding path program 1 times [2018-12-08 20:21:32,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:32,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:32,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:32,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:32,326 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-08 20:21:32,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:32,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:21:32,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:21:32,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:21:32,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:21:32,340 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-08 20:21:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:32,407 INFO L93 Difference]: Finished difference Result 307 states and 392 transitions. [2018-12-08 20:21:32,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:21:32,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-08 20:21:32,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:32,415 INFO L225 Difference]: With dead ends: 307 [2018-12-08 20:21:32,416 INFO L226 Difference]: Without dead ends: 190 [2018-12-08 20:21:32,418 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-08 20:21:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-08 20:21:32,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-12-08 20:21:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-08 20:21:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 227 transitions. [2018-12-08 20:21:32,455 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 227 transitions. Word has length 69 [2018-12-08 20:21:32,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:32,456 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 227 transitions. [2018-12-08 20:21:32,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:21:32,456 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 227 transitions. [2018-12-08 20:21:32,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 20:21:32,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:32,458 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:32,458 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:32,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:32,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1084624468, now seen corresponding path program 1 times [2018-12-08 20:21:32,459 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:32,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:32,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:32,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:32,527 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-08 20:21:32,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:32,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:21:32,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:21:32,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:21:32,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:21:32,529 INFO L87 Difference]: Start difference. First operand 187 states and 227 transitions. Second operand 3 states. [2018-12-08 20:21:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:32,557 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2018-12-08 20:21:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:21:32,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-08 20:21:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:32,560 INFO L225 Difference]: With dead ends: 197 [2018-12-08 20:21:32,560 INFO L226 Difference]: Without dead ends: 192 [2018-12-08 20:21:32,561 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-08 20:21:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-08 20:21:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 187. [2018-12-08 20:21:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-08 20:21:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 226 transitions. [2018-12-08 20:21:32,578 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 226 transitions. Word has length 74 [2018-12-08 20:21:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:32,579 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 226 transitions. [2018-12-08 20:21:32,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:21:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 226 transitions. [2018-12-08 20:21:32,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 20:21:32,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:32,581 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:32,581 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:32,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:32,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1141882770, now seen corresponding path program 1 times [2018-12-08 20:21:32,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:32,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:32,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:32,651 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-08 20:21:32,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:32,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:21:32,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:21:32,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:21:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:21:32,652 INFO L87 Difference]: Start difference. First operand 187 states and 226 transitions. Second operand 3 states. [2018-12-08 20:21:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:32,688 INFO L93 Difference]: Finished difference Result 490 states and 613 transitions. [2018-12-08 20:21:32,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:21:32,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-08 20:21:32,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:32,693 INFO L225 Difference]: With dead ends: 490 [2018-12-08 20:21:32,693 INFO L226 Difference]: Without dead ends: 327 [2018-12-08 20:21:32,694 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-08 20:21:32,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-08 20:21:32,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 323. [2018-12-08 20:21:32,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-12-08 20:21:32,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 401 transitions. [2018-12-08 20:21:32,719 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 401 transitions. Word has length 74 [2018-12-08 20:21:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:32,720 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 401 transitions. [2018-12-08 20:21:32,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:21:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 401 transitions. [2018-12-08 20:21:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 20:21:32,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:32,722 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-08 20:21:32,722 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:32,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:32,722 INFO L82 PathProgramCache]: Analyzing trace with hash 435481164, now seen corresponding path program 1 times [2018-12-08 20:21:32,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:32,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:32,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:32,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:32,782 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-08 20:21:32,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:32,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:21:32,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:21:32,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:21:32,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:21:32,783 INFO L87 Difference]: Start difference. First operand 323 states and 401 transitions. Second operand 3 states. [2018-12-08 20:21:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:32,815 INFO L93 Difference]: Finished difference Result 701 states and 881 transitions. [2018-12-08 20:21:32,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:21:32,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-12-08 20:21:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:32,817 INFO L225 Difference]: With dead ends: 701 [2018-12-08 20:21:32,817 INFO L226 Difference]: Without dead ends: 412 [2018-12-08 20:21:32,819 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-08 20:21:32,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-12-08 20:21:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 399. [2018-12-08 20:21:32,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-08 20:21:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 501 transitions. [2018-12-08 20:21:32,842 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 501 transitions. Word has length 88 [2018-12-08 20:21:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:32,843 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 501 transitions. [2018-12-08 20:21:32,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:21:32,843 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 501 transitions. [2018-12-08 20:21:32,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 20:21:32,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:32,845 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-08 20:21:32,845 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:32,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:32,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2032288072, now seen corresponding path program 1 times [2018-12-08 20:21:32,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:32,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:32,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:32,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:32,947 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-08 20:21:32,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:32,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:21:32,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:21:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:21:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:21:32,949 INFO L87 Difference]: Start difference. First operand 399 states and 501 transitions. Second operand 7 states. [2018-12-08 20:21:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:32,991 INFO L93 Difference]: Finished difference Result 800 states and 1013 transitions. [2018-12-08 20:21:32,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:21:32,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-12-08 20:21:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:32,994 INFO L225 Difference]: With dead ends: 800 [2018-12-08 20:21:32,994 INFO L226 Difference]: Without dead ends: 435 [2018-12-08 20:21:32,995 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-08 20:21:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-08 20:21:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 429. [2018-12-08 20:21:33,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-12-08 20:21:33,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 535 transitions. [2018-12-08 20:21:33,018 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 535 transitions. Word has length 107 [2018-12-08 20:21:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:33,018 INFO L480 AbstractCegarLoop]: Abstraction has 429 states and 535 transitions. [2018-12-08 20:21:33,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:21:33,019 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 535 transitions. [2018-12-08 20:21:33,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 20:21:33,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:33,021 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-08 20:21:33,021 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:33,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:33,021 INFO L82 PathProgramCache]: Analyzing trace with hash 982815546, now seen corresponding path program 1 times [2018-12-08 20:21:33,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:33,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:33,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:33,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:33,081 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-08 20:21:33,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:33,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:21:33,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:21:33,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:21:33,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:21:33,082 INFO L87 Difference]: Start difference. First operand 429 states and 535 transitions. Second operand 3 states. [2018-12-08 20:21:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:33,102 INFO L93 Difference]: Finished difference Result 799 states and 1014 transitions. [2018-12-08 20:21:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:21:33,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-12-08 20:21:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:33,104 INFO L225 Difference]: With dead ends: 799 [2018-12-08 20:21:33,104 INFO L226 Difference]: Without dead ends: 404 [2018-12-08 20:21:33,105 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-08 20:21:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-12-08 20:21:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 392. [2018-12-08 20:21:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-08 20:21:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 488 transitions. [2018-12-08 20:21:33,136 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 488 transitions. Word has length 107 [2018-12-08 20:21:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:33,136 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 488 transitions. [2018-12-08 20:21:33,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:21:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 488 transitions. [2018-12-08 20:21:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-08 20:21:33,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:33,137 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:33,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:33,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:33,137 INFO L82 PathProgramCache]: Analyzing trace with hash 508152540, now seen corresponding path program 1 times [2018-12-08 20:21:33,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:33,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:33,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:33,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:33,238 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-08 20:21:33,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:33,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:21:33,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:21:33,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:21:33,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:21:33,239 INFO L87 Difference]: Start difference. First operand 392 states and 488 transitions. Second operand 7 states. [2018-12-08 20:21:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:33,535 INFO L93 Difference]: Finished difference Result 637 states and 788 transitions. [2018-12-08 20:21:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:21:33,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-08 20:21:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:33,538 INFO L225 Difference]: With dead ends: 637 [2018-12-08 20:21:33,538 INFO L226 Difference]: Without dead ends: 634 [2018-12-08 20:21:33,539 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-08 20:21:33,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2018-12-08 20:21:33,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 599. [2018-12-08 20:21:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-12-08 20:21:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 751 transitions. [2018-12-08 20:21:33,559 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 751 transitions. Word has length 113 [2018-12-08 20:21:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:33,559 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 751 transitions. [2018-12-08 20:21:33,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:21:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 751 transitions. [2018-12-08 20:21:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-08 20:21:33,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:33,561 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:33,561 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:33,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash -812446572, now seen corresponding path program 1 times [2018-12-08 20:21:33,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:33,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 20:21:33,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:33,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:21:33,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:21:33,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:21:33,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:21:33,620 INFO L87 Difference]: Start difference. First operand 599 states and 751 transitions. Second operand 3 states. [2018-12-08 20:21:33,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:33,644 INFO L93 Difference]: Finished difference Result 1033 states and 1296 transitions. [2018-12-08 20:21:33,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:21:33,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-12-08 20:21:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:33,646 INFO L225 Difference]: With dead ends: 1033 [2018-12-08 20:21:33,646 INFO L226 Difference]: Without dead ends: 611 [2018-12-08 20:21:33,647 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-08 20:21:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-12-08 20:21:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 599. [2018-12-08 20:21:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-12-08 20:21:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 747 transitions. [2018-12-08 20:21:33,662 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 747 transitions. Word has length 122 [2018-12-08 20:21:33,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:33,662 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 747 transitions. [2018-12-08 20:21:33,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:21:33,662 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 747 transitions. [2018-12-08 20:21:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-08 20:21:33,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:33,663 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:33,663 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:33,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash -946460078, now seen corresponding path program 1 times [2018-12-08 20:21:33,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:33,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:33,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:33,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 20:21:33,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:33,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:21:33,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:21:33,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:21:33,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:21:33,747 INFO L87 Difference]: Start difference. First operand 599 states and 747 transitions. Second operand 7 states. [2018-12-08 20:21:33,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:33,775 INFO L93 Difference]: Finished difference Result 1025 states and 1278 transitions. [2018-12-08 20:21:33,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:21:33,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-12-08 20:21:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:33,777 INFO L225 Difference]: With dead ends: 1025 [2018-12-08 20:21:33,778 INFO L226 Difference]: Without dead ends: 603 [2018-12-08 20:21:33,778 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-08 20:21:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-12-08 20:21:33,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 597. [2018-12-08 20:21:33,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2018-12-08 20:21:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 741 transitions. [2018-12-08 20:21:33,793 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 741 transitions. Word has length 122 [2018-12-08 20:21:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:33,793 INFO L480 AbstractCegarLoop]: Abstraction has 597 states and 741 transitions. [2018-12-08 20:21:33,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:21:33,793 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 741 transitions. [2018-12-08 20:21:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-08 20:21:33,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:33,795 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:21:33,795 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:33,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1405487414, now seen corresponding path program 1 times [2018-12-08 20:21:33,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:33,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:33,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:33,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 20:21:33,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:21:33,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:21:33,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:21:33,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:21:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:21:33,871 INFO L87 Difference]: Start difference. First operand 597 states and 741 transitions. Second operand 6 states. [2018-12-08 20:21:33,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:21:33,936 INFO L93 Difference]: Finished difference Result 1178 states and 1466 transitions. [2018-12-08 20:21:33,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:21:33,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-12-08 20:21:33,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:21:33,939 INFO L225 Difference]: With dead ends: 1178 [2018-12-08 20:21:33,939 INFO L226 Difference]: Without dead ends: 598 [2018-12-08 20:21:33,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 20:21:33,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-12-08 20:21:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2018-12-08 20:21:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-12-08 20:21:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 742 transitions. [2018-12-08 20:21:33,956 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 742 transitions. Word has length 137 [2018-12-08 20:21:33,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:21:33,956 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 742 transitions. [2018-12-08 20:21:33,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:21:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 742 transitions. [2018-12-08 20:21:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-08 20:21:33,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:21:33,957 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-08 20:21:33,957 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:21:33,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:21:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash 78385292, now seen corresponding path program 1 times [2018-12-08 20:21:33,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 20:21:33,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 20:21:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:33,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 20:21:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-08 20:21:34,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 20:21:34,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 20:21:34,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:21:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:21:34,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:21:34,273 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-08 20:21:34,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,357 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-08 20:21:34,610 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-12-08 20:21:34,615 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,619 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-08 20:21:34,724 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-08 20:21:34,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,738 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-08 20:21:34,856 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-08 20:21:34,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,875 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-08 20:21:34,987 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-12-08 20:21:34,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:34,998 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,010 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-08 20:21:35,133 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-08 20:21:35,139 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,140 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,146 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,155 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,156 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-08 20:21:35,265 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-08 20:21:35,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,281 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-08 20:21:35,287 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-08 20:21:35,287 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 20:21:35,337 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:35,386 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:35,437 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:35,491 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:35,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:35,608 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:35,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:35,775 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-08 20:21:36,121 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-12-08 20:21:36,127 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,136 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,143 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,152 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,175 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-08 20:21:36,508 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2018-12-08 20:21:36,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,521 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,531 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-08 20:21:36,636 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-08 20:21:36,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,655 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-08 20:21:36,781 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-08 20:21:36,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,788 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,790 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,799 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,803 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-08 20:21:36,913 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-08 20:21:36,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,918 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,920 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:36,928 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-08 20:21:36,933 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-08 20:21:36,934 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 20:21:36,985 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:37,034 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:37,088 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:37,161 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:37,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,280 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,324 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-08 20:21:37,695 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-12-08 20:21:37,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,718 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-08 20:21:37,840 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-12-08 20:21:37,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,856 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,865 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-08 20:21:37,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:37,969 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-08 20:21:37,973 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-08 20:21:37,973 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 20:21:38,025 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:38,073 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:38,130 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:38,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 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-08 20:21:38,588 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-12-08 20:21:38,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,599 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-08 20:21:38,707 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-08 20:21:38,711 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,714 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,715 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,718 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,720 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,722 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,723 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-08 20:21:38,729 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-08 20:21:38,730 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 20:21:38,782 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:38,838 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:38,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:38,989 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-08 20:21:39,403 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2018-12-08 20:21:39,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,412 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,414 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,417 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,422 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,435 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-08 20:21:39,439 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-08 20:21:39,440 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 20:21:39,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:39,653 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-08 20:21:39,654 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-12-08 20:21:39,908 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 20:21:40,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:40,223 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-08 20:21:40,228 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-08 20:21:40,229 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 20:21:40,307 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:40,620 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-08 20:21:40,978 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-08 20:21:41,369 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-08 20:21:42,049 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-08 20:21:42,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,666 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-08 20:21:42,769 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-08 20:21:42,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,779 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,790 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-08 20:21:42,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:42,904 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-08 20:21:43,064 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-08 20:21:43,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,093 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,095 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-08 20:21:43,250 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-08 20:21:43,263 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,264 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,267 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,268 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:21:43,273 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-08 20:21:43,277 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-08 20:21:43,278 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 20:21:43,330 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:43,379 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:43,430 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:43,484 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:43,540 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:21:44,089 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-12-08 20:21:44,770 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-08 20:21:45,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-08 20:21:46,684 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-08 20:21:46,684 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 8 variables, input treesize:188, output treesize:1539 [2018-12-08 20:21:56,553 WARN L180 SmtUtils]: Spent 9.79 s on a formula simplification. DAG size of input: 707 DAG size of output: 257 [2018-12-08 20:22:04,621 WARN L180 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 257 [2018-12-08 20:22:04,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,636 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 257 [2018-12-08 20:22:04,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:04,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:04,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 233 [2018-12-08 20:22:04,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:05,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:05,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:05,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:05,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:05,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:05,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:05,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:05,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:05,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 20:22:05,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 37 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 172 [2018-12-08 20:22:05,213 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:05,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 20:22:05,453 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 23 variables, input treesize:543, output treesize:91 [2018-12-08 20:22:05,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-08 20:22:05,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-08 20:22:05,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:05,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:05,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-12-08 20:22:05,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-08 20:22:05,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:05,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:05,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:05,540 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2018-12-08 20:22:17,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 20:22:17,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 20:22:17,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:17,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:17,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-12-08 20:22:17,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-08 20:22:17,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:17,200 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:17,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 20:22:17,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:51, output treesize:43 [2018-12-08 20:22:18,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2018-12-08 20:22:18,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-08 20:22:18,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:18,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 20:22:18,882 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:18,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:18,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2018-12-08 20:22:18,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-08 20:22:18,894 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:18,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-08 20:22:18,898 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:18,899 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:18,904 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-08 20:22:18,904 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:46, output treesize:10 [2018-12-08 20:22:22,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 20:22:22,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 20:22:22,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:22,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:22,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:22,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-12-08 20:22:25,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 34 treesize of output 65 [2018-12-08 20:22:25,637 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 20:22:25,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-12-08 20:22:25,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:25,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-12-08 20:22:25,680 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:25,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:25,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 59 [2018-12-08 20:22:25,745 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-08 20:22:25,746 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:25,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-12-08 20:22:25,788 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:25,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:25,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-08 20:22:25,822 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:78, output treesize:70 [2018-12-08 20:22:30,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-12-08 20:22:30,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-12-08 20:22:30,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:30,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:30,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-08 20:22:30,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:59 [2018-12-08 20:22:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 3 refuted. 7 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-08 20:22:41,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:22:41,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 23] total 28 [2018-12-08 20:22:41,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-08 20:22:41,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-08 20:22:41,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=629, Unknown=43, NotChecked=0, Total=756 [2018-12-08 20:22:41,164 INFO L87 Difference]: Start difference. First operand 598 states and 742 transitions. Second operand 28 states. [2018-12-08 20:22:52,910 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-08 20:22:52,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 20:22:52,911 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java: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.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 49 more [2018-12-08 20:22:52,914 INFO L168 Benchmark]: Toolchain (without parser) took 82032.56 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 559.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 381.1 MB. Max. memory is 11.5 GB. [2018-12-08 20:22:52,914 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:22:52,914 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.4 MB). Peak memory consumption was 101.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:22:52,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:22:52,915 INFO L168 Benchmark]: Boogie Preprocessor took 29.95 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-12-08 20:22:52,915 INFO L168 Benchmark]: RCFGBuilder took 421.93 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2018-12-08 20:22:52,915 INFO L168 Benchmark]: TraceAbstraction took 80879.97 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 402.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -100.7 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. [2018-12-08 20:22:52,917 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 674.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -141.4 MB). Peak memory consumption was 101.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.31 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.95 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 421.93 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 80879.97 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 402.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -100.7 MB). Peak memory consumption was 302.0 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-08 20:22:53,905 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 20:22:53,906 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 20:22:53,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 20:22:53,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 20:22:53,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 20:22:53,916 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 20:22:53,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 20:22:53,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 20:22:53,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 20:22:53,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 20:22:53,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 20:22:53,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 20:22:53,921 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 20:22:53,922 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 20:22:53,922 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 20:22:53,923 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 20:22:53,924 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 20:22:53,925 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 20:22:53,926 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 20:22:53,927 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 20:22:53,928 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 20:22:53,929 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 20:22:53,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 20:22:53,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 20:22:53,930 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 20:22:53,931 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 20:22:53,931 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 20:22:53,931 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 20:22:53,932 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 20:22:53,932 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 20:22:53,933 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 20:22:53,933 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 20:22:53,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 20:22:53,934 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 20:22:53,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 20:22:53,934 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2018-12-08 20:22:53,944 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 20:22:53,944 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 20:22:53,945 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 20:22:53,945 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 20:22:53,946 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 20:22:53,946 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 20:22:53,946 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 20:22:53,946 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 20:22:53,946 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 20:22:53,947 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 20:22:53,947 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 20:22:53,947 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 20:22:53,947 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 20:22:53,947 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 20:22:53,947 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 20:22:53,947 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 20:22:53,948 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 20:22:53,948 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 20:22:53,948 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 20:22:53,948 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 20:22:53,948 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 20:22:53,948 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:22:53,949 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 20:22:53,949 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 20:22:53,949 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 20:22:53,949 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-08 20:22:53,949 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 20:22:53,949 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 20:22:53,950 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 20:22:53,950 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 20:22:53,950 INFO L133 SettingsManager]: * To the following directory=dump/ Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af2001ab830213f8cdb559c777be1d107ce8fe72 [2018-12-08 20:22:53,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 20:22:53,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 20:22:53,986 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 20:22:53,987 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 20:22:53,988 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 20:22:53,988 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.i [2018-12-08 20:22:54,030 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data/0a3890225/a972b7686c1848509af598df6d2f8d3f/FLAG12e1cad90 [2018-12-08 20:22:54,573 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 20:22:54,573 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/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-08 20:22:54,588 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data/0a3890225/a972b7686c1848509af598df6d2f8d3f/FLAG12e1cad90 [2018-12-08 20:22:55,064 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/data/0a3890225/a972b7686c1848509af598df6d2f8d3f [2018-12-08 20:22:55,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 20:22:55,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 20:22:55,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 20:22:55,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 20:22:55,070 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 20:22:55,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47abe2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55, skipping insertion in model container [2018-12-08 20:22:55,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 20:22:55,137 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 20:22:55,657 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:22:55,673 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 20:22:55,774 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 20:22:55,797 INFO L195 MainTranslator]: Completed translation [2018-12-08 20:22:55,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55 WrapperNode [2018-12-08 20:22:55,797 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 20:22:55,798 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 20:22:55,798 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 20:22:55,798 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 20:22:55,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 20:22:55,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 20:22:55,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 20:22:55,821 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 20:22:55,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... [2018-12-08 20:22:55,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 20:22:55,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 20:22:55,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 20:22:55,852 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 20:22:55,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 20:22:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-12-08 20:22:55,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-12-08 20:22:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 20:22:55,884 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 20:22:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-12-08 20:22:55,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-12-08 20:22:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 20:22:55,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 20:22:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-12-08 20:22:55,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-12-08 20:22:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-08 20:22:55,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-08 20:22:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-12-08 20:22:55,885 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-12-08 20:22:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 20:22:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-12-08 20:22:55,885 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-12-08 20:22:55,885 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-12-08 20:22:55,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-12-08 20:22:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-12-08 20:22:55,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-12-08 20:22:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-12-08 20:22:55,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-12-08 20:22:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 20:22:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 20:22:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2018-12-08 20:22:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-12-08 20:22:55,886 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-12-08 20:22:55,887 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-12-08 20:22:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-12-08 20:22:55,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-12-08 20:22:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-12-08 20:22:55,887 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-12-08 20:22:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-12-08 20:22:55,887 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-12-08 20:22:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-08 20:22:55,887 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-08 20:22:55,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-12-08 20:22:55,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-12-08 20:22:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 20:22:55,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 20:22:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-12-08 20:22:55,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-12-08 20:22:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-08 20:22:55,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-08 20:22:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-12-08 20:22:55,888 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-12-08 20:22:55,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 20:22:55,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 20:22:55,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-12-08 20:22:55,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-12-08 20:22:56,309 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 20:22:56,309 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 20:22:56,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:22:56 BoogieIcfgContainer [2018-12-08 20:22:56,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 20:22:56,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 20:22:56,310 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 20:22:56,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 20:22:56,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 08:22:55" (1/3) ... [2018-12-08 20:22:56,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa59a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:22:56, skipping insertion in model container [2018-12-08 20:22:56,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:22:55" (2/3) ... [2018-12-08 20:22:56,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aa59a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 08:22:56, skipping insertion in model container [2018-12-08 20:22:56,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:22:56" (3/3) ... [2018-12-08 20:22:56,315 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-08 20:22:56,324 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 20:22:56,330 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 20:22:56,339 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 20:22:56,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 20:22:56,362 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 20:22:56,362 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 20:22:56,362 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 20:22:56,363 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 20:22:56,363 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 20:22:56,363 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 20:22:56,363 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 20:22:56,363 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 20:22:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-08 20:22:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-08 20:22:56,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:22:56,385 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-08 20:22:56,387 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:22:56,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:22:56,390 INFO L82 PathProgramCache]: Analyzing trace with hash 250893536, now seen corresponding path program 1 times [2018-12-08 20:22:56,394 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:22:56,394 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:22:56,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:22:56,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:22:56,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:22:56,594 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-08 20:22:56,594 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 20:22:56,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:22:56,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:22:56,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:22:56,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:22:56,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:22:56,610 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-08 20:22:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:22:56,656 INFO L93 Difference]: Finished difference Result 327 states and 419 transitions. [2018-12-08 20:22:56,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:22:56,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-08 20:22:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:22:56,666 INFO L225 Difference]: With dead ends: 327 [2018-12-08 20:22:56,666 INFO L226 Difference]: Without dead ends: 200 [2018-12-08 20:22:56,668 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-08 20:22:56,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-08 20:22:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-12-08 20:22:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-08 20:22:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 241 transitions. [2018-12-08 20:22:56,706 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 241 transitions. Word has length 69 [2018-12-08 20:22:56,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:22:56,706 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 241 transitions. [2018-12-08 20:22:56,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:22:56,706 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 241 transitions. [2018-12-08 20:22:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-08 20:22:56,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:22:56,709 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-08 20:22:56,709 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:22:56,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:22:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash 469035080, now seen corresponding path program 1 times [2018-12-08 20:22:56,710 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:22:56,710 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:22:56,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:22:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:22:56,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:22:56,907 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-08 20:22:56,907 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 20:22:56,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:22:56,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:22:56,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:22:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:22:56,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:22:56,911 INFO L87 Difference]: Start difference. First operand 197 states and 241 transitions. Second operand 3 states. [2018-12-08 20:22:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:22:56,963 INFO L93 Difference]: Finished difference Result 423 states and 525 transitions. [2018-12-08 20:22:56,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:22:56,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-12-08 20:22:56,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:22:56,966 INFO L225 Difference]: With dead ends: 423 [2018-12-08 20:22:56,966 INFO L226 Difference]: Without dead ends: 260 [2018-12-08 20:22:56,967 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-08 20:22:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-08 20:22:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 247. [2018-12-08 20:22:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-08 20:22:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2018-12-08 20:22:56,986 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 88 [2018-12-08 20:22:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:22:56,986 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2018-12-08 20:22:56,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:22:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2018-12-08 20:22:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 20:22:56,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:22:56,990 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-08 20:22:56,990 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:22:56,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:22:56,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1305361854, now seen corresponding path program 1 times [2018-12-08 20:22:56,991 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:22:56,991 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:22:57,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:22:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:22:57,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:22:57,201 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-08 20:22:57,205 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-08 20:22:57,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:57,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:57,226 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-08 20:22:57,230 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-08 20:22:57,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 20:22:57,233 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 20:22:57,236 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-08 20:22:57,237 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:7 [2018-12-08 20:22:57,269 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-08 20:22:57,270 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 20:22:57,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:22:57,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 20:22:57,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 20:22:57,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 20:22:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 20:22:57,272 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand 5 states. [2018-12-08 20:22:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:22:57,442 INFO L93 Difference]: Finished difference Result 470 states and 592 transitions. [2018-12-08 20:22:57,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 20:22:57,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-08 20:22:57,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:22:57,444 INFO L225 Difference]: With dead ends: 470 [2018-12-08 20:22:57,444 INFO L226 Difference]: Without dead ends: 257 [2018-12-08 20:22:57,445 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-08 20:22:57,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-08 20:22:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-12-08 20:22:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-08 20:22:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 314 transitions. [2018-12-08 20:22:57,456 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 314 transitions. Word has length 107 [2018-12-08 20:22:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:22:57,456 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 314 transitions. [2018-12-08 20:22:57,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 20:22:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 314 transitions. [2018-12-08 20:22:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-08 20:22:57,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:22:57,458 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-08 20:22:57,458 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:22:57,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:22:57,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1603402048, now seen corresponding path program 1 times [2018-12-08 20:22:57,459 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:22:57,459 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:22:57,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:22:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:22:57,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:22:57,856 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-08 20:22:57,857 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 20:22:57,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:22:57,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:22:57,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:22:57,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:22:57,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:22:57,861 INFO L87 Difference]: Start difference. First operand 254 states and 314 transitions. Second operand 6 states. [2018-12-08 20:22:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:22:57,951 INFO L93 Difference]: Finished difference Result 492 states and 612 transitions. [2018-12-08 20:22:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 20:22:57,952 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-12-08 20:22:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:22:57,953 INFO L225 Difference]: With dead ends: 492 [2018-12-08 20:22:57,953 INFO L226 Difference]: Without dead ends: 255 [2018-12-08 20:22:57,954 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-08 20:22:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-08 20:22:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-12-08 20:22:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-08 20:22:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 315 transitions. [2018-12-08 20:22:57,966 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 315 transitions. Word has length 107 [2018-12-08 20:22:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:22:57,966 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 315 transitions. [2018-12-08 20:22:57,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:22:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 315 transitions. [2018-12-08 20:22:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-08 20:22:57,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:22:57,968 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-08 20:22:57,968 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:22:57,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:22:57,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1129967362, now seen corresponding path program 1 times [2018-12-08 20:22:57,968 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:22:57,968 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:22:57,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:22:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:22:58,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:22:58,377 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-08 20:22:58,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:22:58,529 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-08 20:22:58,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:22:58,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-12-08 20:22:58,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-08 20:22:58,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-08 20:22:58,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-08 20:22:58,534 INFO L87 Difference]: Start difference. First operand 255 states and 315 transitions. Second operand 11 states. [2018-12-08 20:22:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:22:58,702 INFO L93 Difference]: Finished difference Result 494 states and 614 transitions. [2018-12-08 20:22:58,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:22:58,703 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 109 [2018-12-08 20:22:58,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:22:58,704 INFO L225 Difference]: With dead ends: 494 [2018-12-08 20:22:58,704 INFO L226 Difference]: Without dead ends: 256 [2018-12-08 20:22:58,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:22:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-08 20:22:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-12-08 20:22:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-08 20:22:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 316 transitions. [2018-12-08 20:22:58,714 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 316 transitions. Word has length 109 [2018-12-08 20:22:58,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:22:58,715 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 316 transitions. [2018-12-08 20:22:58,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-08 20:22:58,715 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 316 transitions. [2018-12-08 20:22:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 20:22:58,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:22:58,716 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-08 20:22:58,716 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:22:58,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:22:58,716 INFO L82 PathProgramCache]: Analyzing trace with hash -369324864, now seen corresponding path program 2 times [2018-12-08 20:22:58,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:22:58,716 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:22:58,738 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 20:22:59,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 20:22:59,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:22:59,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:22:59,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-08 20:22:59,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 20:22:59,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:22:59,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 20:22:59,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 20:22:59,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 20:22:59,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:22:59,079 INFO L87 Difference]: Start difference. First operand 256 states and 316 transitions. Second operand 7 states. [2018-12-08 20:22:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:22:59,107 INFO L93 Difference]: Finished difference Result 494 states and 618 transitions. [2018-12-08 20:22:59,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 20:22:59,107 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-08 20:22:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:22:59,108 INFO L225 Difference]: With dead ends: 494 [2018-12-08 20:22:59,108 INFO L226 Difference]: Without dead ends: 274 [2018-12-08 20:22:59,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 20:22:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-08 20:22:59,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2018-12-08 20:22:59,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-08 20:22:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 322 transitions. [2018-12-08 20:22:59,118 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 322 transitions. Word has length 111 [2018-12-08 20:22:59,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:22:59,119 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 322 transitions. [2018-12-08 20:22:59,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 20:22:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 322 transitions. [2018-12-08 20:22:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-08 20:22:59,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:22:59,120 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-08 20:22:59,120 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:22:59,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:22:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1649188542, now seen corresponding path program 1 times [2018-12-08 20:22:59,120 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:22:59,120 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:22:59,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:22:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:22:59,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:22:59,257 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-08 20:22:59,257 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 20:22:59,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:22:59,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:22:59,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:22:59,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:22:59,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:22:59,259 INFO L87 Difference]: Start difference. First operand 263 states and 322 transitions. Second operand 3 states. [2018-12-08 20:22:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:22:59,274 INFO L93 Difference]: Finished difference Result 481 states and 600 transitions. [2018-12-08 20:22:59,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:22:59,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-08 20:22:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:22:59,276 INFO L225 Difference]: With dead ends: 481 [2018-12-08 20:22:59,276 INFO L226 Difference]: Without dead ends: 254 [2018-12-08 20:22:59,276 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-08 20:22:59,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-08 20:22:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2018-12-08 20:22:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-08 20:22:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 305 transitions. [2018-12-08 20:22:59,283 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 305 transitions. Word has length 111 [2018-12-08 20:22:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:22:59,283 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 305 transitions. [2018-12-08 20:22:59,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:22:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 305 transitions. [2018-12-08 20:22:59,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-08 20:22:59,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:22:59,284 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-08 20:22:59,284 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:22:59,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:22:59,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1486664420, now seen corresponding path program 1 times [2018-12-08 20:22:59,284 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:22:59,284 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:22:59,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:22:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:22:59,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:22:59,742 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-08 20:22:59,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:22:59,964 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-08 20:22:59,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:22:59,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-12-08 20:22:59,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 20:22:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 20:22:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:22:59,969 INFO L87 Difference]: Start difference. First operand 248 states and 305 transitions. Second operand 13 states. [2018-12-08 20:23:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:23:00,142 INFO L93 Difference]: Finished difference Result 480 states and 594 transitions. [2018-12-08 20:23:00,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:23:00,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 117 [2018-12-08 20:23:00,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:23:00,144 INFO L225 Difference]: With dead ends: 480 [2018-12-08 20:23:00,144 INFO L226 Difference]: Without dead ends: 249 [2018-12-08 20:23:00,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-12-08 20:23:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-12-08 20:23:00,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-12-08 20:23:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-08 20:23:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 306 transitions. [2018-12-08 20:23:00,152 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 306 transitions. Word has length 117 [2018-12-08 20:23:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:23:00,152 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 306 transitions. [2018-12-08 20:23:00,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 20:23:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 306 transitions. [2018-12-08 20:23:00,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-08 20:23:00,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:23:00,154 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:23:00,154 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:23:00,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:23:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1911980326, now seen corresponding path program 2 times [2018-12-08 20:23:00,155 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:23:00,155 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:23:00,176 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 20:23:00,484 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 20:23:00,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:23:00,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:23:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-08 20:23:00,532 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 20:23:00,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:23:00,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 20:23:00,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 20:23:00,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 20:23:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 20:23:00,536 INFO L87 Difference]: Start difference. First operand 249 states and 306 transitions. Second operand 6 states. [2018-12-08 20:23:01,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:23:01,047 INFO L93 Difference]: Finished difference Result 498 states and 614 transitions. [2018-12-08 20:23:01,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 20:23:01,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-12-08 20:23:01,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:23:01,050 INFO L225 Difference]: With dead ends: 498 [2018-12-08 20:23:01,050 INFO L226 Difference]: Without dead ends: 484 [2018-12-08 20:23:01,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-08 20:23:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-12-08 20:23:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 280. [2018-12-08 20:23:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-08 20:23:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 337 transitions. [2018-12-08 20:23:01,061 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 337 transitions. Word has length 119 [2018-12-08 20:23:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:23:01,061 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 337 transitions. [2018-12-08 20:23:01,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 20:23:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 337 transitions. [2018-12-08 20:23:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-08 20:23:01,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:23:01,062 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-08 20:23:01,063 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:23:01,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:23:01,063 INFO L82 PathProgramCache]: Analyzing trace with hash 255289994, now seen corresponding path program 1 times [2018-12-08 20:23:01,063 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:23:01,063 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:23:01,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:23:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:23:01,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:23:01,204 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-08 20:23:01,204 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 20:23:01,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:23:01,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 20:23:01,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 20:23:01,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 20:23:01,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 20:23:01,207 INFO L87 Difference]: Start difference. First operand 280 states and 337 transitions. Second operand 3 states. [2018-12-08 20:23:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:23:01,224 INFO L93 Difference]: Finished difference Result 416 states and 503 transitions. [2018-12-08 20:23:01,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 20:23:01,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-12-08 20:23:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:23:01,226 INFO L225 Difference]: With dead ends: 416 [2018-12-08 20:23:01,226 INFO L226 Difference]: Without dead ends: 289 [2018-12-08 20:23:01,227 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-08 20:23:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-08 20:23:01,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 280. [2018-12-08 20:23:01,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-08 20:23:01,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2018-12-08 20:23:01,238 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 128 [2018-12-08 20:23:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:23:01,239 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2018-12-08 20:23:01,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 20:23:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2018-12-08 20:23:01,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-08 20:23:01,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:23:01,240 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-08 20:23:01,240 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:23:01,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:23:01,241 INFO L82 PathProgramCache]: Analyzing trace with hash 121276488, now seen corresponding path program 1 times [2018-12-08 20:23:01,241 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:23:01,241 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:23:01,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 20:23:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:23:01,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:23:01,732 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-08 20:23:01,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:23:02,003 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-08 20:23:02,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 20:23:02,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-12-08 20:23:02,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-08 20:23:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-08 20:23:02,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-12-08 20:23:02,007 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand 15 states. [2018-12-08 20:23:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:23:02,250 INFO L93 Difference]: Finished difference Result 544 states and 654 transitions. [2018-12-08 20:23:02,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 20:23:02,250 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 128 [2018-12-08 20:23:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:23:02,251 INFO L225 Difference]: With dead ends: 544 [2018-12-08 20:23:02,251 INFO L226 Difference]: Without dead ends: 281 [2018-12-08 20:23:02,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-12-08 20:23:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-08 20:23:02,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-12-08 20:23:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-08 20:23:02,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 336 transitions. [2018-12-08 20:23:02,259 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 336 transitions. Word has length 128 [2018-12-08 20:23:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:23:02,259 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 336 transitions. [2018-12-08 20:23:02,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-08 20:23:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 336 transitions. [2018-12-08 20:23:02,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-08 20:23:02,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:23:02,260 INFO L402 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 20:23:02,260 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:23:02,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:23:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash -8579510, now seen corresponding path program 2 times [2018-12-08 20:23:02,261 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:23:02,261 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:23:02,296 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 20:23:02,939 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-12-08 20:23:02,939 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-08 20:23:02,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-08 20:23:02,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 20:23:03,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 20:23:03,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 20:23:03,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:23:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-08 20:23:03,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 20:23:03,343 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-08 20:23:03,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 20:23:03,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2018-12-08 20:23:03,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 20:23:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 20:23:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-12-08 20:23:03,362 INFO L87 Difference]: Start difference. First operand 281 states and 336 transitions. Second operand 13 states. [2018-12-08 20:23:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:23:03,579 INFO L93 Difference]: Finished difference Result 720 states and 878 transitions. [2018-12-08 20:23:03,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 20:23:03,580 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-12-08 20:23:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:23:03,581 INFO L225 Difference]: With dead ends: 720 [2018-12-08 20:23:03,581 INFO L226 Difference]: Without dead ends: 477 [2018-12-08 20:23:03,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-12-08 20:23:03,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-08 20:23:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 462. [2018-12-08 20:23:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-12-08 20:23:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 551 transitions. [2018-12-08 20:23:03,600 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 551 transitions. Word has length 130 [2018-12-08 20:23:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:23:03,601 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 551 transitions. [2018-12-08 20:23:03,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 20:23:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 551 transitions. [2018-12-08 20:23:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-08 20:23:03,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 20:23:03,602 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-08 20:23:03,602 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 20:23:03,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 20:23:03,603 INFO L82 PathProgramCache]: Analyzing trace with hash 810441938, now seen corresponding path program 1 times [2018-12-08 20:23:03,603 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 20:23:03,603 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 20:23:03,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 20:23:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 20:23:04,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 20:23:05,421 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-08 20:23:05,421 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 20:23:05,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 20:23:05,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-08 20:23:05,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-08 20:23:05,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 20:23:05,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-08 20:23:05,427 INFO L87 Difference]: Start difference. First operand 462 states and 551 transitions. Second operand 14 states. [2018-12-08 20:23:10,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 20:23:10,670 INFO L93 Difference]: Finished difference Result 651 states and 782 transitions. [2018-12-08 20:23:10,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 20:23:10,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2018-12-08 20:23:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 20:23:10,672 INFO L225 Difference]: With dead ends: 651 [2018-12-08 20:23:10,672 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 20:23:10,673 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-08 20:23:10,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 20:23:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 20:23:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 20:23:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 20:23:10,673 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-12-08 20:23:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 20:23:10,673 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 20:23:10,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-08 20:23:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 20:23:10,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 20:23:10,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 20:23:10,980 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-12-08 20:23:11,635 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2018-12-08 20:23:11,801 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-12-08 20:23:11,945 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2018-12-08 20:23:12,133 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2018-12-08 20:23:12,398 WARN L180 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 7 [2018-12-08 20:23:12,676 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-08 20:23:12,847 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 20 [2018-12-08 20:23:13,019 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 14 [2018-12-08 20:23:13,022 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-12-08 20:23:13,022 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-12-08 20:23:13,022 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-12-08 20:23:13,022 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-12-08 20:23:13,022 INFO L451 ceAbstractionStarter]: At program point ldv_undef_intENTRY(lines 5900 5907) the Hoare annotation is: true [2018-12-08 20:23:13,022 INFO L448 ceAbstractionStarter]: For program point ldv_undef_intFINAL(lines 5900 5907) no Hoare annotation was computed. [2018-12-08 20:23:13,022 INFO L448 ceAbstractionStarter]: For program point ldv_undef_intEXIT(lines 5900 5907) no Hoare annotation was computed. [2018-12-08 20:23:13,022 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 6151 6238) no Hoare annotation was computed. [2018-12-08 20:23:13,022 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-08 20:23:13,022 INFO L448 ceAbstractionStarter]: For program point L6163-1(line 6163) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6229(line 6229) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L451 ceAbstractionStarter]: At program point L6188(line 6188) the Hoare annotation is: true [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6180(line 6180) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L451 ceAbstractionStarter]: At program point L6230(line 6230) the Hoare annotation is: true [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6197(lines 6197 6224) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6222(line 6222) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6181(lines 6181 6185) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6206(line 6206) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6198(line 6198) no Hoare annotation was computed. [2018-12-08 20:23:13,023 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-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6165-1(line 6165) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L451 ceAbstractionStarter]: At program point L6223(line 6223) the Hoare annotation is: true [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 6151 6238) no Hoare annotation was computed. [2018-12-08 20:23:13,023 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-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6182-1(line 6182) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6207(lines 6207 6220) no Hoare annotation was computed. [2018-12-08 20:23:13,023 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-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6199(lines 6199 6204) no Hoare annotation was computed. [2018-12-08 20:23:13,023 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-08 20:23:13,023 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-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6208-1(line 6208) no Hoare annotation was computed. [2018-12-08 20:23:13,023 INFO L448 ceAbstractionStarter]: For program point L6175(lines 6175 6231) no Hoare annotation was computed. [2018-12-08 20:23:13,024 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-08 20:23:13,024 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-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6200-1(line 6200) no Hoare annotation was computed. [2018-12-08 20:23:13,024 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-08 20:23:13,024 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-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6209-2(lines 6207 6219) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6209(lines 6209 6213) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6176(line 6176) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6168(line 6168) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6177(lines 6177 6192) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6235(line 6235) no Hoare annotation was computed. [2018-12-08 20:23:13,024 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-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6169-1(line 6169) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6194(line 6194) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6195(lines 6195 6227) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6187(line 6187) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L6179(lines 6179 6189) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L451 ceAbstractionStarter]: At program point L5886(line 5886) the Hoare annotation is: true [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point ldv_init_zallocFINAL(lines 5881 5891) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point L5886-1(line 5886) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L448 ceAbstractionStarter]: For program point ldv_init_zallocEXIT(lines 5881 5891) no Hoare annotation was computed. [2018-12-08 20:23:13,024 INFO L451 ceAbstractionStarter]: At program point ldv_init_zallocENTRY(lines 5881 5891) the Hoare annotation is: true [2018-12-08 20:23:13,025 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-08 20:23:13,025 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-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point L6315(lines 6315 6320) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point L6313(lines 6313 6322) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point L6314-1(line 6314) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 6309 6325) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 6309 6325) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point pppox_initFINAL(lines 6133 6140) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L451 ceAbstractionStarter]: At program point pppox_initENTRY(lines 6133 6140) the Hoare annotation is: true [2018-12-08 20:23:13,025 INFO L451 ceAbstractionStarter]: At program point L6137(line 6137) the Hoare annotation is: true [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point L6137-1(line 6137) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point pppox_initEXIT(lines 6133 6140) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L451 ceAbstractionStarter]: At program point sock_unregisterENTRY(lines 6391 6393) the Hoare annotation is: true [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point sock_unregisterEXIT(lines 6391 6393) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point sock_unregisterFINAL(lines 6391 6393) no Hoare annotation was computed. [2018-12-08 20:23:13,025 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-08 20:23:13,025 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-08 20:23:13,025 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-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 20:23:13,025 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-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 20:23:13,025 INFO L448 ceAbstractionStarter]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6259) no Hoare annotation was computed. [2018-12-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point ldv_errorFINAL(lines 6255 6261) no Hoare annotation was computed. [2018-12-08 20:23:13,026 INFO L451 ceAbstractionStarter]: At program point ldv_errorENTRY(lines 6255 6261) the Hoare annotation is: true [2018-12-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point ldv_errorEXIT(lines 6255 6261) no Hoare annotation was computed. [2018-12-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_5EXIT(lines 6239 6246) no Hoare annotation was computed. [2018-12-08 20:23:13,026 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-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_5FINAL(lines 6239 6246) no Hoare annotation was computed. [2018-12-08 20:23:13,026 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-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point L6243-1(line 6243) no Hoare annotation was computed. [2018-12-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2018-12-08 20:23:13,026 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-08 20:23:13,026 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-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point pppox_createFINAL(lines 6096 6131) no Hoare annotation was computed. [2018-12-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point L6126-1(line 6126) no Hoare annotation was computed. [2018-12-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point L6116-2(lines 6114 6125) no Hoare annotation was computed. [2018-12-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point L6116(lines 6116 6120) no Hoare annotation was computed. [2018-12-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point L6112(lines 6112 6125) no Hoare annotation was computed. [2018-12-08 20:23:13,026 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-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point L6108-2(lines 6108 6111) no Hoare annotation was computed. [2018-12-08 20:23:13,026 INFO L448 ceAbstractionStarter]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2018-12-08 20:23:13,026 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-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point L6127-1(line 6127) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point pppox_createEXIT(lines 6096 6131) no Hoare annotation was computed. [2018-12-08 20:23:13,027 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-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point L6115-1(line 6115) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 6354 6363) the Hoare annotation is: true [2018-12-08 20:23:13,027 INFO L444 ceAbstractionStarter]: At program point L6358(line 6358) the Hoare annotation is: (not (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 6354 6363) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point L6357(lines 6354 6363) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point ldv_stopFINAL(lines 5924 5930) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point ldv_stopEXIT(lines 5924 5930) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L451 ceAbstractionStarter]: At program point ldv_stopENTRY(lines 5924 5930) the Hoare annotation is: true [2018-12-08 20:23:13,027 INFO L451 ceAbstractionStarter]: At program point sock_registerENTRY(lines 6388 6390) the Hoare annotation is: true [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point sock_registerEXIT(lines 6388 6390) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point sock_registerFINAL(lines 6388 6390) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 20:23:13,027 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-08 20:23:13,027 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L451 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 6371 6373) the Hoare annotation is: true [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 6371 6373) no Hoare annotation was computed. [2018-12-08 20:23:13,027 INFO L448 ceAbstractionStarter]: For program point L6330(lines 6330 6333) no Hoare annotation was computed. [2018-12-08 20:23:13,028 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-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point L6329-2(lines 6326 6339) no Hoare annotation was computed. [2018-12-08 20:23:13,028 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-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point L6329(lines 6329 6336) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point L6330-1(lines 6330 6333) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 6326 6339) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point ldv_memsetFINAL(lines 5892 5899) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point L5896-1(line 5896) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L451 ceAbstractionStarter]: At program point ldv_memsetENTRY(lines 5892 5899) the Hoare annotation is: true [2018-12-08 20:23:13,028 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-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point ldv_memsetEXIT(lines 5892 5899) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L451 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-12-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_6EXIT(lines 6247 6253) no Hoare annotation was computed. [2018-12-08 20:23:13,028 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-08 20:23:13,028 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-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_6FINAL(lines 6247 6253) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L448 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 6141 6147) no Hoare annotation was computed. [2018-12-08 20:23:13,028 INFO L451 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 6141 6147) the Hoare annotation is: true [2018-12-08 20:23:13,029 INFO L448 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 6141 6147) no Hoare annotation was computed. [2018-12-08 20:23:13,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 08:23:13 BoogieIcfgContainer [2018-12-08 20:23:13,038 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 20:23:13,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 20:23:13,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 20:23:13,038 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 20:23:13,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:22:56" (3/4) ... [2018-12-08 20:23:13,042 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 20:23:13,046 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_unregister [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_5 [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_register [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_initialize [2018-12-08 20:23:13,047 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-12-08 20:23:13,048 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2018-12-08 20:23:13,048 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2018-12-08 20:23:13,048 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_6 [2018-12-08 20:23:13,048 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-12-08 20:23:13,052 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2018-12-08 20:23:13,052 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-12-08 20:23:13,052 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-12-08 20:23:13,053 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-08 20:23:13,053 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-08 20:23:13,070 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-08 20:23:13,070 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-08 20:23:13,071 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1bv32 == \old(ldv_module_refcounter)) || 1bv32 == ldv_module_refcounter [2018-12-08 20:23:13,097 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4f7d0cfd-7b8f-4652-bedc-cb85b7bd2128/bin-2019/uautomizer/witness.graphml [2018-12-08 20:23:13,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 20:23:13,098 INFO L168 Benchmark]: Toolchain (without parser) took 18031.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 344.5 MB). Free memory was 932.6 MB in the beginning and 888.5 MB in the end (delta: 44.1 MB). Peak memory consumption was 388.5 MB. Max. memory is 11.5 GB. [2018-12-08 20:23:13,098 INFO L168 Benchmark]: CDTParser took 0.15 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-08 20:23:13,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2018-12-08 20:23:13,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 20:23:13,099 INFO L168 Benchmark]: Boogie Preprocessor took 30.79 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.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-12-08 20:23:13,099 INFO L168 Benchmark]: RCFGBuilder took 457.25 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: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. [2018-12-08 20:23:13,099 INFO L168 Benchmark]: TraceAbstraction took 16727.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.0 GB in the beginning and 897.4 MB in the end (delta: 141.3 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. [2018-12-08 20:23:13,099 INFO L168 Benchmark]: Witness Printer took 59.45 ms. Allocated memory is still 1.4 GB. Free memory was 897.4 MB in the beginning and 888.5 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-12-08 20:23:13,100 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.15 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 730.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -169.4 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.79 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.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 457.25 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: 58.0 MB). Peak memory consumption was 58.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16727.76 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.0 GB in the beginning and 897.4 MB in the end (delta: 141.3 MB). Peak memory consumption was 319.6 MB. Max. memory is 11.5 GB. * Witness Printer took 59.45 ms. Allocated memory is still 1.4 GB. Free memory was 897.4 MB in the beginning and 888.5 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.6s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 7.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2110 SDtfs, 775 SDslu, 8789 SDs, 0 SdLazy, 1144 SolverSat, 159 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1970 GetRequests, 1861 SyntacticMatches, 5 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 264 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 49 LocationsWithAnnotation, 640 PreInvPairs, 691 NumberOfFragments, 824 HoareAnnotationTreeSize, 640 FomulaSimplifications, 6498 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 49 FomulaSimplificationsInter, 5707 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1936 ConstructedInterpolants, 12 QuantifiedInterpolants, 461404 SizeOfPredicates, 43 NumberOfNonLiveVariables, 6908 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 598/667 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...