./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1259db070705cc8318f4cd544a981db9ba453479 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 1259db070705cc8318f4cd544a981db9ba453479 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:16:09,941 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:16:09,943 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:16:09,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:16:09,951 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:16:09,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:16:09,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:16:09,955 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:16:09,956 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:16:09,957 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:16:09,958 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:16:09,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:16:09,959 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:16:09,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:16:09,960 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:16:09,961 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:16:09,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:16:09,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:16:09,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:16:09,965 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:16:09,966 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:16:09,968 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:16:09,969 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:16:09,970 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:16:09,970 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:16:09,971 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:16:09,971 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:16:09,972 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:16:09,972 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:16:09,973 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:16:09,973 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:16:09,974 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:16:09,974 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:16:09,974 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:16:09,975 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:16:09,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:16:09,975 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-18 17:16:09,988 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:16:09,988 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:16:09,989 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:16:09,989 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:16:09,989 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:16:09,989 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:16:09,989 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:16:09,990 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 17:16:09,990 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:16:09,990 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:16:09,990 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-18 17:16:09,990 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 17:16:09,990 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 17:16:09,990 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:16:09,991 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:16:09,991 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:16:09,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:16:09,992 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:16:09,992 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:16:09,992 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:16:09,992 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:16:09,992 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:16:09,992 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:16:09,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:16:09,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:16:09,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:16:09,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:16:09,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:16:09,993 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:16:09,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:16:09,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:16:09,994 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 17:16:09,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:16:09,994 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:16:09,994 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:16:09,994 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-18 17:16:09,995 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1259db070705cc8318f4cd544a981db9ba453479 [2018-11-18 17:16:10,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:16:10,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:16:10,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:16:10,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:16:10,041 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:16:10,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-18 17:16:10,096 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data/c862694fd/995ed5455bb8453c9b39c832001ff87c/FLAG240803bcb [2018-11-18 17:16:10,583 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:16:10,584 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-18 17:16:10,607 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data/c862694fd/995ed5455bb8453c9b39c832001ff87c/FLAG240803bcb [2018-11-18 17:16:11,113 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data/c862694fd/995ed5455bb8453c9b39c832001ff87c [2018-11-18 17:16:11,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:16:11,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:16:11,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:16:11,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:16:11,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:16:11,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:16:11" (1/1) ... [2018-11-18 17:16:11,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fc6dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:11, skipping insertion in model container [2018-11-18 17:16:11,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:16:11" (1/1) ... [2018-11-18 17:16:11,131 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:16:11,192 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:16:12,023 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:16:12,071 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:16:12,433 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:16:12,500 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:16:12,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12 WrapperNode [2018-11-18 17:16:12,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:16:12,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:16:12,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:16:12,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:16:12,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... [2018-11-18 17:16:12,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... [2018-11-18 17:16:12,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:16:12,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:16:12,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:16:12,543 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:16:12,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... [2018-11-18 17:16:12,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... [2018-11-18 17:16:12,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... [2018-11-18 17:16:12,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... [2018-11-18 17:16:12,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... [2018-11-18 17:16:12,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... [2018-11-18 17:16:12,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... [2018-11-18 17:16:12,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:16:12,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:16:12,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:16:12,616 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:16:12,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:16:12,667 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-18 17:16:12,667 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-18 17:16:12,668 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:16:12,668 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:16:12,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 17:16:12,668 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-18 17:16:12,668 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-18 17:16:12,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:16:12,669 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-18 17:16:12,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:16:12,669 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-18 17:16:12,669 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-18 17:16:12,669 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 17:16:12,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 17:16:12,670 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-18 17:16:12,670 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-18 17:16:12,670 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-18 17:16:12,670 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_init [2018-11-18 17:16:12,670 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_init [2018-11-18 17:16:12,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:16:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2018-11-18 17:16:12,671 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2018-11-18 17:16:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2018-11-18 17:16:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-18 17:16:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-18 17:16:12,671 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-18 17:16:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_probe [2018-11-18 17:16:12,672 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_probe [2018-11-18 17:16:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-18 17:16:12,672 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-18 17:16:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-18 17:16:12,672 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-18 17:16:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-18 17:16:12,672 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-18 17:16:12,672 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-18 17:16:12,673 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-18 17:16:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_exit [2018-11-18 17:16:12,673 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_exit [2018-11-18 17:16:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2018-11-18 17:16:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_disconnect [2018-11-18 17:16:12,673 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_disconnect [2018-11-18 17:16:12,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-18 17:16:12,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-18 17:16:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-18 17:16:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-18 17:16:12,674 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-18 17:16:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-18 17:16:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-18 17:16:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2018-11-18 17:16:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-18 17:16:12,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 17:16:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-18 17:16:12,675 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-18 17:16:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-18 17:16:12,675 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-18 17:16:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-18 17:16:12,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-18 17:16:12,675 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-18 17:16:12,675 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-18 17:16:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2018-11-18 17:16:12,676 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2018-11-18 17:16:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2018-11-18 17:16:12,676 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2018-11-18 17:16:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-18 17:16:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-18 17:16:12,676 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-18 17:16:12,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-18 17:16:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-18 17:16:12,677 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-18 17:16:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:16:12,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:16:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2018-11-18 17:16:12,677 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2018-11-18 17:16:12,677 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-18 17:16:12,677 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-18 17:16:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 17:16:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 17:16:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-18 17:16:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-18 17:16:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:16:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:16:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-18 17:16:12,921 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 17:16:12,921 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 17:16:14,125 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:16:14,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:16:14 BoogieIcfgContainer [2018-11-18 17:16:14,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:16:14,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:16:14,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:16:14,129 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:16:14,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:16:11" (1/3) ... [2018-11-18 17:16:14,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678a2358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:16:14, skipping insertion in model container [2018-11-18 17:16:14,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:12" (2/3) ... [2018-11-18 17:16:14,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@678a2358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:16:14, skipping insertion in model container [2018-11-18 17:16:14,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:16:14" (3/3) ... [2018-11-18 17:16:14,133 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-18 17:16:14,143 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:16:14,152 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:16:14,169 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:16:14,202 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:16:14,202 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:16:14,203 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:16:14,203 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:16:14,203 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:16:14,203 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:16:14,203 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:16:14,203 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:16:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states. [2018-11-18 17:16:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:16:14,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:14,233 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:14,236 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:14,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2036007237, now seen corresponding path program 1 times [2018-11-18 17:16:14,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:14,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:14,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:14,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:14,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:14,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:16:14,576 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:14,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:16:14,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:16:14,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:14,594 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 3 states. [2018-11-18 17:16:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:14,700 INFO L93 Difference]: Finished difference Result 618 states and 806 transitions. [2018-11-18 17:16:14,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:16:14,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 17:16:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:14,718 INFO L225 Difference]: With dead ends: 618 [2018-11-18 17:16:14,718 INFO L226 Difference]: Without dead ends: 399 [2018-11-18 17:16:14,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:14,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-18 17:16:14,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2018-11-18 17:16:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-11-18 17:16:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 478 transitions. [2018-11-18 17:16:14,793 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 478 transitions. Word has length 23 [2018-11-18 17:16:14,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:14,794 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 478 transitions. [2018-11-18 17:16:14,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:16:14,794 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 478 transitions. [2018-11-18 17:16:14,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:16:14,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:14,795 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:14,795 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:14,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:14,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1308139505, now seen corresponding path program 1 times [2018-11-18 17:16:14,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:14,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:14,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:14,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:14,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:14,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:14,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:16:14,890 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:14,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:16:14,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:16:14,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:14,893 INFO L87 Difference]: Start difference. First operand 395 states and 478 transitions. Second operand 3 states. [2018-11-18 17:16:14,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:14,960 INFO L93 Difference]: Finished difference Result 1144 states and 1403 transitions. [2018-11-18 17:16:14,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:16:14,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 17:16:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:14,966 INFO L225 Difference]: With dead ends: 1144 [2018-11-18 17:16:14,967 INFO L226 Difference]: Without dead ends: 761 [2018-11-18 17:16:14,969 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-11-18 17:16:15,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 754. [2018-11-18 17:16:15,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-11-18 17:16:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 918 transitions. [2018-11-18 17:16:15,017 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 918 transitions. Word has length 24 [2018-11-18 17:16:15,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:15,017 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 918 transitions. [2018-11-18 17:16:15,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:16:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 918 transitions. [2018-11-18 17:16:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 17:16:15,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:15,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:15,019 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:15,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:15,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1435356449, now seen corresponding path program 1 times [2018-11-18 17:16:15,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:15,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:15,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:15,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:15,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:15,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:15,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:16:15,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:15,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:16:15,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:16:15,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:15,122 INFO L87 Difference]: Start difference. First operand 754 states and 918 transitions. Second operand 6 states. [2018-11-18 17:16:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:15,188 INFO L93 Difference]: Finished difference Result 1494 states and 1821 transitions. [2018-11-18 17:16:15,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:16:15,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-18 17:16:15,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:15,195 INFO L225 Difference]: With dead ends: 1494 [2018-11-18 17:16:15,195 INFO L226 Difference]: Without dead ends: 754 [2018-11-18 17:16:15,198 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:16:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-11-18 17:16:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2018-11-18 17:16:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2018-11-18 17:16:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 917 transitions. [2018-11-18 17:16:15,232 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 917 transitions. Word has length 48 [2018-11-18 17:16:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:15,233 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 917 transitions. [2018-11-18 17:16:15,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:16:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 917 transitions. [2018-11-18 17:16:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 17:16:15,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:15,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:15,235 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:15,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:15,235 INFO L82 PathProgramCache]: Analyzing trace with hash -2015605345, now seen corresponding path program 1 times [2018-11-18 17:16:15,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:15,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:15,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:15,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:15,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:15,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:15,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:15,339 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:15,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:15,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:15,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:15,340 INFO L87 Difference]: Start difference. First operand 754 states and 917 transitions. Second operand 5 states. [2018-11-18 17:16:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:15,529 INFO L93 Difference]: Finished difference Result 1623 states and 2012 transitions. [2018-11-18 17:16:15,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:16:15,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-18 17:16:15,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:15,534 INFO L225 Difference]: With dead ends: 1623 [2018-11-18 17:16:15,534 INFO L226 Difference]: Without dead ends: 886 [2018-11-18 17:16:15,538 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:16:15,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-11-18 17:16:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 833. [2018-11-18 17:16:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2018-11-18 17:16:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1026 transitions. [2018-11-18 17:16:15,576 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1026 transitions. Word has length 48 [2018-11-18 17:16:15,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:15,576 INFO L480 AbstractCegarLoop]: Abstraction has 833 states and 1026 transitions. [2018-11-18 17:16:15,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1026 transitions. [2018-11-18 17:16:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 17:16:15,578 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:15,578 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:16:15,579 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:15,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:15,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1799634123, now seen corresponding path program 1 times [2018-11-18 17:16:15,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:15,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:15,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:15,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:15,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:15,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:15,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:15,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:15,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:15,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:15,669 INFO L87 Difference]: Start difference. First operand 833 states and 1026 transitions. Second operand 5 states. [2018-11-18 17:16:17,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:17,742 INFO L93 Difference]: Finished difference Result 1686 states and 2075 transitions. [2018-11-18 17:16:17,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:17,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 17:16:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:17,747 INFO L225 Difference]: With dead ends: 1686 [2018-11-18 17:16:17,748 INFO L226 Difference]: Without dead ends: 868 [2018-11-18 17:16:17,751 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:17,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-11-18 17:16:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 845. [2018-11-18 17:16:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-11-18 17:16:17,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1036 transitions. [2018-11-18 17:16:17,788 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1036 transitions. Word has length 67 [2018-11-18 17:16:17,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:17,788 INFO L480 AbstractCegarLoop]: Abstraction has 845 states and 1036 transitions. [2018-11-18 17:16:17,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1036 transitions. [2018-11-18 17:16:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 17:16:17,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:17,791 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:17,791 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:17,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:17,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1925760965, now seen corresponding path program 1 times [2018-11-18 17:16:17,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:17,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:17,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:17,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:17,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:17,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:17,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:16:17,896 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:17,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:16:17,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:16:17,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:17,897 INFO L87 Difference]: Start difference. First operand 845 states and 1036 transitions. Second operand 6 states. [2018-11-18 17:16:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:17,976 INFO L93 Difference]: Finished difference Result 1697 states and 2091 transitions. [2018-11-18 17:16:17,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:16:17,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-18 17:16:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:17,981 INFO L225 Difference]: With dead ends: 1697 [2018-11-18 17:16:17,981 INFO L226 Difference]: Without dead ends: 866 [2018-11-18 17:16:17,984 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:16:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2018-11-18 17:16:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 860. [2018-11-18 17:16:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2018-11-18 17:16:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1049 transitions. [2018-11-18 17:16:18,020 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1049 transitions. Word has length 112 [2018-11-18 17:16:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:18,021 INFO L480 AbstractCegarLoop]: Abstraction has 860 states and 1049 transitions. [2018-11-18 17:16:18,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:16:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1049 transitions. [2018-11-18 17:16:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 17:16:18,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:18,023 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:18,023 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:18,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:18,023 INFO L82 PathProgramCache]: Analyzing trace with hash 702752190, now seen corresponding path program 1 times [2018-11-18 17:16:18,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:18,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:18,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:18,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:18,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:18,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:18,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:18,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:18,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:18,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:18,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:18,155 INFO L87 Difference]: Start difference. First operand 860 states and 1049 transitions. Second operand 5 states. [2018-11-18 17:16:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:18,211 INFO L93 Difference]: Finished difference Result 1302 states and 1594 transitions. [2018-11-18 17:16:18,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:18,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-11-18 17:16:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:18,216 INFO L225 Difference]: With dead ends: 1302 [2018-11-18 17:16:18,217 INFO L226 Difference]: Without dead ends: 868 [2018-11-18 17:16:18,218 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:18,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2018-11-18 17:16:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 868. [2018-11-18 17:16:18,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-11-18 17:16:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1057 transitions. [2018-11-18 17:16:18,260 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1057 transitions. Word has length 118 [2018-11-18 17:16:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:18,261 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 1057 transitions. [2018-11-18 17:16:18,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1057 transitions. [2018-11-18 17:16:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 17:16:18,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:18,263 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:18,264 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:18,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:18,264 INFO L82 PathProgramCache]: Analyzing trace with hash -135071224, now seen corresponding path program 1 times [2018-11-18 17:16:18,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:18,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:18,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:18,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:18,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:18,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:18,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:18,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:18,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:18,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:18,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:18,432 INFO L87 Difference]: Start difference. First operand 868 states and 1057 transitions. Second operand 5 states. [2018-11-18 17:16:18,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:18,459 INFO L93 Difference]: Finished difference Result 1452 states and 1770 transitions. [2018-11-18 17:16:18,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:18,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-11-18 17:16:18,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:18,462 INFO L225 Difference]: With dead ends: 1452 [2018-11-18 17:16:18,462 INFO L226 Difference]: Without dead ends: 603 [2018-11-18 17:16:18,464 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-11-18 17:16:18,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2018-11-18 17:16:18,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-11-18 17:16:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 724 transitions. [2018-11-18 17:16:18,481 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 724 transitions. Word has length 124 [2018-11-18 17:16:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:18,482 INFO L480 AbstractCegarLoop]: Abstraction has 603 states and 724 transitions. [2018-11-18 17:16:18,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 724 transitions. [2018-11-18 17:16:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 17:16:18,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:18,483 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:18,483 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:18,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2082686729, now seen corresponding path program 1 times [2018-11-18 17:16:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:18,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:18,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:18,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:18,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:18,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:16:18,624 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:18,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:16:18,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:16:18,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:18,625 INFO L87 Difference]: Start difference. First operand 603 states and 724 transitions. Second operand 6 states. [2018-11-18 17:16:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:19,920 INFO L93 Difference]: Finished difference Result 1078 states and 1305 transitions. [2018-11-18 17:16:19,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:16:19,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-11-18 17:16:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:19,928 INFO L225 Difference]: With dead ends: 1078 [2018-11-18 17:16:19,928 INFO L226 Difference]: Without dead ends: 1075 [2018-11-18 17:16:19,929 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:16:19,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2018-11-18 17:16:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1041. [2018-11-18 17:16:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1041 states. [2018-11-18 17:16:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1269 transitions. [2018-11-18 17:16:19,979 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1269 transitions. Word has length 124 [2018-11-18 17:16:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:19,979 INFO L480 AbstractCegarLoop]: Abstraction has 1041 states and 1269 transitions. [2018-11-18 17:16:19,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:16:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1269 transitions. [2018-11-18 17:16:19,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 17:16:19,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:19,981 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:19,981 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:19,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:19,982 INFO L82 PathProgramCache]: Analyzing trace with hash 353905152, now seen corresponding path program 1 times [2018-11-18 17:16:19,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:19,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:19,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:19,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:19,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:20,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:20,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:20,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:16:20,102 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:20,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:16:20,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:16:20,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:20,103 INFO L87 Difference]: Start difference. First operand 1041 states and 1269 transitions. Second operand 6 states. [2018-11-18 17:16:22,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:22,216 INFO L93 Difference]: Finished difference Result 2058 states and 2522 transitions. [2018-11-18 17:16:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:16:22,217 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-18 17:16:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:22,222 INFO L225 Difference]: With dead ends: 2058 [2018-11-18 17:16:22,222 INFO L226 Difference]: Without dead ends: 1027 [2018-11-18 17:16:22,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:16:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-11-18 17:16:22,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 994. [2018-11-18 17:16:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2018-11-18 17:16:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1223 transitions. [2018-11-18 17:16:22,277 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1223 transitions. Word has length 127 [2018-11-18 17:16:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:22,278 INFO L480 AbstractCegarLoop]: Abstraction has 994 states and 1223 transitions. [2018-11-18 17:16:22,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:16:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1223 transitions. [2018-11-18 17:16:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 17:16:22,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:22,280 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:22,280 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:22,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1945753985, now seen corresponding path program 1 times [2018-11-18 17:16:22,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:22,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:22,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:22,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:22,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:22,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:22,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:16:22,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:22,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:16:22,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:16:22,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:22,438 INFO L87 Difference]: Start difference. First operand 994 states and 1223 transitions. Second operand 3 states. [2018-11-18 17:16:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:22,480 INFO L93 Difference]: Finished difference Result 1868 states and 2331 transitions. [2018-11-18 17:16:22,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:16:22,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-11-18 17:16:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:22,486 INFO L225 Difference]: With dead ends: 1868 [2018-11-18 17:16:22,486 INFO L226 Difference]: Without dead ends: 970 [2018-11-18 17:16:22,488 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-11-18 17:16:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2018-11-18 17:16:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-11-18 17:16:22,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1184 transitions. [2018-11-18 17:16:22,538 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1184 transitions. Word has length 137 [2018-11-18 17:16:22,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:22,538 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 1184 transitions. [2018-11-18 17:16:22,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:16:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1184 transitions. [2018-11-18 17:16:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 17:16:22,540 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:22,541 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:22,541 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:22,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:22,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1064828348, now seen corresponding path program 1 times [2018-11-18 17:16:22,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:22,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:22,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:22,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:22,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:22,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:22,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:22,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:22,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:22,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:22,670 INFO L87 Difference]: Start difference. First operand 970 states and 1184 transitions. Second operand 5 states. [2018-11-18 17:16:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:22,716 INFO L93 Difference]: Finished difference Result 1015 states and 1234 transitions. [2018-11-18 17:16:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:22,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-11-18 17:16:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:22,722 INFO L225 Difference]: With dead ends: 1015 [2018-11-18 17:16:22,723 INFO L226 Difference]: Without dead ends: 978 [2018-11-18 17:16:22,723 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2018-11-18 17:16:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2018-11-18 17:16:22,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-11-18 17:16:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1189 transitions. [2018-11-18 17:16:22,772 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1189 transitions. Word has length 139 [2018-11-18 17:16:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:22,773 INFO L480 AbstractCegarLoop]: Abstraction has 978 states and 1189 transitions. [2018-11-18 17:16:22,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1189 transitions. [2018-11-18 17:16:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-11-18 17:16:22,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:22,775 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:22,775 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:22,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:22,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1701005105, now seen corresponding path program 1 times [2018-11-18 17:16:22,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:22,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:22,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:22,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:22,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:22,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:22,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 17:16:22,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:22,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 17:16:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 17:16:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:16:22,993 INFO L87 Difference]: Start difference. First operand 978 states and 1189 transitions. Second operand 8 states. [2018-11-18 17:16:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:24,615 INFO L93 Difference]: Finished difference Result 2067 states and 2631 transitions. [2018-11-18 17:16:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 17:16:24,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 140 [2018-11-18 17:16:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:24,620 INFO L225 Difference]: With dead ends: 2067 [2018-11-18 17:16:24,620 INFO L226 Difference]: Without dead ends: 1577 [2018-11-18 17:16:24,622 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:16:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2018-11-18 17:16:24,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1257. [2018-11-18 17:16:24,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2018-11-18 17:16:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1526 transitions. [2018-11-18 17:16:24,676 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1526 transitions. Word has length 140 [2018-11-18 17:16:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:24,676 INFO L480 AbstractCegarLoop]: Abstraction has 1257 states and 1526 transitions. [2018-11-18 17:16:24,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 17:16:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1526 transitions. [2018-11-18 17:16:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 17:16:24,679 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:24,679 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:24,679 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:24,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:24,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2079453447, now seen corresponding path program 1 times [2018-11-18 17:16:24,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:24,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:24,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:24,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:24,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:24,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:24,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:24,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:24,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:24,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:24,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:24,841 INFO L87 Difference]: Start difference. First operand 1257 states and 1526 transitions. Second operand 5 states. [2018-11-18 17:16:24,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:24,899 INFO L93 Difference]: Finished difference Result 1891 states and 2299 transitions. [2018-11-18 17:16:24,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:24,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2018-11-18 17:16:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:24,902 INFO L225 Difference]: With dead ends: 1891 [2018-11-18 17:16:24,902 INFO L226 Difference]: Without dead ends: 711 [2018-11-18 17:16:24,904 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:24,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2018-11-18 17:16:24,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2018-11-18 17:16:24,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-11-18 17:16:24,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 851 transitions. [2018-11-18 17:16:24,927 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 851 transitions. Word has length 156 [2018-11-18 17:16:24,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:24,927 INFO L480 AbstractCegarLoop]: Abstraction has 711 states and 851 transitions. [2018-11-18 17:16:24,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:24,928 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 851 transitions. [2018-11-18 17:16:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-18 17:16:24,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:24,930 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:24,930 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:24,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash -108513990, now seen corresponding path program 1 times [2018-11-18 17:16:24,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:24,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:24,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:24,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:24,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:25,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:25,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:25,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:16:25,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:25,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:16:25,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:16:25,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:25,104 INFO L87 Difference]: Start difference. First operand 711 states and 851 transitions. Second operand 6 states. [2018-11-18 17:16:27,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:27,836 INFO L93 Difference]: Finished difference Result 1143 states and 1377 transitions. [2018-11-18 17:16:27,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:16:27,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2018-11-18 17:16:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:27,840 INFO L225 Difference]: With dead ends: 1143 [2018-11-18 17:16:27,840 INFO L226 Difference]: Without dead ends: 1138 [2018-11-18 17:16:27,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:16:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-11-18 17:16:27,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1098. [2018-11-18 17:16:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1098 states. [2018-11-18 17:16:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1098 states to 1098 states and 1331 transitions. [2018-11-18 17:16:27,879 INFO L78 Accepts]: Start accepts. Automaton has 1098 states and 1331 transitions. Word has length 156 [2018-11-18 17:16:27,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:27,880 INFO L480 AbstractCegarLoop]: Abstraction has 1098 states and 1331 transitions. [2018-11-18 17:16:27,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:16:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1098 states and 1331 transitions. [2018-11-18 17:16:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-11-18 17:16:27,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:27,881 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:27,882 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:27,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1770125779, now seen corresponding path program 1 times [2018-11-18 17:16:27,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:27,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:27,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:27,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:27,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:27,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:27,960 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 17:16:27,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:27,961 INFO L87 Difference]: Start difference. First operand 1098 states and 1331 transitions. Second operand 5 states. [2018-11-18 17:16:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:28,020 INFO L93 Difference]: Finished difference Result 1136 states and 1371 transitions. [2018-11-18 17:16:28,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:28,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2018-11-18 17:16:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:28,024 INFO L225 Difference]: With dead ends: 1136 [2018-11-18 17:16:28,024 INFO L226 Difference]: Without dead ends: 1119 [2018-11-18 17:16:28,025 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:16:28,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2018-11-18 17:16:28,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1102. [2018-11-18 17:16:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2018-11-18 17:16:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1334 transitions. [2018-11-18 17:16:28,062 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1334 transitions. Word has length 163 [2018-11-18 17:16:28,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:28,062 INFO L480 AbstractCegarLoop]: Abstraction has 1102 states and 1334 transitions. [2018-11-18 17:16:28,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:28,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1334 transitions. [2018-11-18 17:16:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-18 17:16:28,064 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:28,064 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:28,065 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:28,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:28,065 INFO L82 PathProgramCache]: Analyzing trace with hash 822886381, now seen corresponding path program 1 times [2018-11-18 17:16:28,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 17:16:28,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:28,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:28,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:16:28,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 17:16:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:28,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:16:28,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 17:16:28,181 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2018-11-18 17:16:28,182 INFO L202 CegarAbsIntRunner]: [0], [2], [7], [11], [17], [19], [22], [24], [29], [31], [34], [46], [48], [53], [117], [121], [127], [129], [133], [137], [138], [140], [143], [147], [148], [149], [150], [188], [190], [194], [196], [199], [202], [204], [206], [208], [210], [215], [220], [222], [227], [229], [234], [237], [241], [253], [255], [258], [263], [265], [267], [272], [274], [276], [281], [283], [293], [294], [297], [301], [302], [303], [304], [306], [307], [308], [309], [310], [311], [329], [332], [335], [344], [345], [346], [347], [348], [350], [351], [354], [355], [356], [357], [358], [360], [363], [365], [368], [375], [376], [377], [378], [379], [380], [381], [382], [383], [386], [389], [393], [406], [408], [409], [410], [415], [426], [430], [436], [438], [442], [446], [450], [451], [452], [453], [456], [457], [458], [464], [465], [470], [471], [472], [473], [474], [475], [476], [477], [478], [479], [480], [481], [482], [483], [484], [485], [486], [487], [488], [489], [490], [491], [492], [493], [494], [495], [500], [501], [512], [513], [514], [515], [516], [517], [518], [522], [523], [524] [2018-11-18 17:16:28,223 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 17:16:28,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 17:16:28,311 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:291) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.AssumptionBuilder.constructBoogieAssumeStatement(AssumptionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.getCachedCodeBlock(TermConjunctEvaluator.java:273) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:296) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-11-18 17:16:28,317 INFO L168 Benchmark]: Toolchain (without parser) took 17201.02 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.2 MB). Free memory was 957.0 MB in the beginning and 1.3 GB in the end (delta: -364.3 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:28,319 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:16:28,319 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1384.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -97.9 MB). Peak memory consumption was 241.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:28,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:28,322 INFO L168 Benchmark]: Boogie Preprocessor took 73.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:28,322 INFO L168 Benchmark]: RCFGBuilder took 1509.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 882.8 MB in the end (delta: 159.9 MB). Peak memory consumption was 159.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:28,323 INFO L168 Benchmark]: TraceAbstraction took 14190.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 882.8 MB in the beginning and 1.3 GB in the end (delta: -438.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:16:28,326 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1384.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -97.9 MB). Peak memory consumption was 241.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.2 MB). Peak memory consumption was 5.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1509.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 882.8 MB in the end (delta: 159.9 MB). Peak memory consumption was 159.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14190.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 232.8 MB). Free memory was 882.8 MB in the beginning and 1.3 GB in the end (delta: -438.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 17:16:30,064 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:16:30,066 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:16:30,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:16:30,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:16:30,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:16:30,077 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:16:30,078 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:16:30,080 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:16:30,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:16:30,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:16:30,081 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:16:30,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:16:30,084 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:16:30,085 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:16:30,085 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:16:30,086 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:16:30,087 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:16:30,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:16:30,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:16:30,093 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:16:30,094 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:16:30,096 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:16:30,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:16:30,097 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:16:30,098 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:16:30,098 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:16:30,099 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:16:30,100 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:16:30,101 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:16:30,102 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:16:30,102 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:16:30,102 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:16:30,103 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:16:30,103 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:16:30,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:16:30,105 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf [2018-11-18 17:16:30,118 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:16:30,118 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:16:30,119 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:16:30,119 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 17:16:30,119 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 17:16:30,119 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 17:16:30,119 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 17:16:30,119 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 17:16:30,120 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 17:16:30,120 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 17:16:30,120 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:16:30,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:16:30,121 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:16:30,121 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:16:30,121 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:16:30,121 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 17:16:30,121 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 17:16:30,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:16:30,122 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:16:30,122 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:16:30,122 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:16:30,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:16:30,122 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:16:30,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:16:30,123 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:16:30,123 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:16:30,123 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:16:30,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:16:30,123 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 17:16:30,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:16:30,124 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 17:16:30,124 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 17:16:30,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1259db070705cc8318f4cd544a981db9ba453479 [2018-11-18 17:16:30,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:16:30,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:16:30,172 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:16:30,173 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:16:30,174 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:16:30,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-18 17:16:30,220 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data/ac0d8e30d/74e5f7d205014ec7b2d1b9f6900e52f9/FLAG95e713122 [2018-11-18 17:16:30,749 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:16:30,750 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-18 17:16:30,769 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data/ac0d8e30d/74e5f7d205014ec7b2d1b9f6900e52f9/FLAG95e713122 [2018-11-18 17:16:31,199 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/data/ac0d8e30d/74e5f7d205014ec7b2d1b9f6900e52f9 [2018-11-18 17:16:31,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:16:31,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 17:16:31,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:16:31,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:16:31,209 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:16:31,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:16:31" (1/1) ... [2018-11-18 17:16:31,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5004f960 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:31, skipping insertion in model container [2018-11-18 17:16:31,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:16:31" (1/1) ... [2018-11-18 17:16:31,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:16:31,289 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:16:32,291 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:16:32,472 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:16:32,763 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:16:32,839 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:16:32,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32 WrapperNode [2018-11-18 17:16:32,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:16:32,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 17:16:32,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 17:16:32,841 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 17:16:32,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... [2018-11-18 17:16:32,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... [2018-11-18 17:16:32,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 17:16:32,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:16:32,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:16:32,886 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:16:32,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... [2018-11-18 17:16:32,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... [2018-11-18 17:16:32,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... [2018-11-18 17:16:32,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... [2018-11-18 17:16:32,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... [2018-11-18 17:16:32,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... [2018-11-18 17:16:32,954 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... [2018-11-18 17:16:32,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:16:32,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:16:32,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:16:32,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:16:32,966 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:16:33,022 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2018-11-18 17:16:33,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-18 17:16:33,022 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2018-11-18 17:16:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:16:33,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:16:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2018-11-18 17:16:33,023 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2018-11-18 17:16:33,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:16:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2018-11-18 17:16:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-18 17:16:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:16:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 17:16:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2018-11-18 17:16:33,024 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2018-11-18 17:16:33,025 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2018-11-18 17:16:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 17:16:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2018-11-18 17:16:33,026 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2018-11-18 17:16:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2018-11-18 17:16:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_init [2018-11-18 17:16:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_init [2018-11-18 17:16:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:16:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2018-11-18 17:16:33,027 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2018-11-18 17:16:33,027 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2018-11-18 17:16:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2018-11-18 17:16:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2018-11-18 17:16:33,028 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2018-11-18 17:16:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_probe [2018-11-18 17:16:33,028 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_probe [2018-11-18 17:16:33,028 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2018-11-18 17:16:33,028 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2018-11-18 17:16:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2018-11-18 17:16:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2018-11-18 17:16:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2018-11-18 17:16:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2018-11-18 17:16:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2018-11-18 17:16:33,029 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2018-11-18 17:16:33,029 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_exit [2018-11-18 17:16:33,030 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_exit [2018-11-18 17:16:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2018-11-18 17:16:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-18 17:16:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mouse_disconnect [2018-11-18 17:16:33,030 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mouse_disconnect [2018-11-18 17:16:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2018-11-18 17:16:33,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2018-11-18 17:16:33,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2018-11-18 17:16:33,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 17:16:33,031 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2018-11-18 17:16:33,032 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2018-11-18 17:16:33,033 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2018-11-18 17:16:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2018-11-18 17:16:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-11-18 17:16:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2018-11-18 17:16:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2018-11-18 17:16:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2018-11-18 17:16:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2018-11-18 17:16:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2018-11-18 17:16:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2018-11-18 17:16:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2018-11-18 17:16:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2018-11-18 17:16:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2018-11-18 17:16:33,035 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2018-11-18 17:16:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2018-11-18 17:16:33,035 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2018-11-18 17:16:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 17:16:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2018-11-18 17:16:33,036 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2018-11-18 17:16:33,036 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2018-11-18 17:16:33,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2018-11-18 17:16:33,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2018-11-18 17:16:33,037 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2018-11-18 17:16:33,037 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2018-11-18 17:16:33,037 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2018-11-18 17:16:33,037 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2018-11-18 17:16:33,038 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2018-11-18 17:16:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2018-11-18 17:16:33,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:16:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:16:33,038 INFO L130 BoogieDeclarations]: Found specification of procedure usb_maxpacket [2018-11-18 17:16:33,038 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_maxpacket [2018-11-18 17:16:33,038 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2018-11-18 17:16:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2018-11-18 17:16:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 17:16:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 17:16:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2018-11-18 17:16:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2018-11-18 17:16:33,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:16:33,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:16:33,040 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2018-11-18 17:16:33,348 WARN L684 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-18 17:16:33,348 WARN L649 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-18 17:16:36,416 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:16:36,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:16:36 BoogieIcfgContainer [2018-11-18 17:16:36,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:16:36,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:16:36,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:16:36,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:16:36,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:16:31" (1/3) ... [2018-11-18 17:16:36,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a3d1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:16:36, skipping insertion in model container [2018-11-18 17:16:36,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:16:32" (2/3) ... [2018-11-18 17:16:36,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a3d1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:16:36, skipping insertion in model container [2018-11-18 17:16:36,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:16:36" (3/3) ... [2018-11-18 17:16:36,424 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-hid-usbhid-usbmouse.ko_false-unreach-call.cil.out.i.pp.i [2018-11-18 17:16:36,434 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:16:36,443 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:16:36,459 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:16:36,486 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:16:36,486 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:16:36,487 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:16:36,487 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:16:36,487 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:16:36,487 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:16:36,487 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:16:36,487 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:16:36,487 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:16:36,509 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states. [2018-11-18 17:16:36,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 17:16:36,515 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:36,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:36,518 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:36,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2036007237, now seen corresponding path program 1 times [2018-11-18 17:16:36,530 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:36,531 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:36,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:36,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:36,767 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:36,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:36,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:16:36,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:16:36,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:16:36,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:36,793 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 3 states. [2018-11-18 17:16:36,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:36,899 INFO L93 Difference]: Finished difference Result 576 states and 750 transitions. [2018-11-18 17:16:36,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:16:36,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 17:16:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:36,915 INFO L225 Difference]: With dead ends: 576 [2018-11-18 17:16:36,916 INFO L226 Difference]: Without dead ends: 319 [2018-11-18 17:16:36,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-18 17:16:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2018-11-18 17:16:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-11-18 17:16:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 374 transitions. [2018-11-18 17:16:36,992 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 374 transitions. Word has length 23 [2018-11-18 17:16:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:36,993 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 374 transitions. [2018-11-18 17:16:36,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:16:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 374 transitions. [2018-11-18 17:16:36,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 17:16:36,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:36,994 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:36,994 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:36,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:36,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1308139505, now seen corresponding path program 1 times [2018-11-18 17:16:36,995 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:36,995 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:37,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:37,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:37,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:37,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:37,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:16:37,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:16:37,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:16:37,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:37,151 INFO L87 Difference]: Start difference. First operand 315 states and 374 transitions. Second operand 3 states. [2018-11-18 17:16:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:37,212 INFO L93 Difference]: Finished difference Result 904 states and 1091 transitions. [2018-11-18 17:16:37,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:16:37,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 17:16:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:37,219 INFO L225 Difference]: With dead ends: 904 [2018-11-18 17:16:37,219 INFO L226 Difference]: Without dead ends: 601 [2018-11-18 17:16:37,221 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:37,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-11-18 17:16:37,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 594. [2018-11-18 17:16:37,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-18 17:16:37,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 710 transitions. [2018-11-18 17:16:37,267 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 710 transitions. Word has length 24 [2018-11-18 17:16:37,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:37,267 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 710 transitions. [2018-11-18 17:16:37,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:16:37,268 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 710 transitions. [2018-11-18 17:16:37,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 17:16:37,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:37,269 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:37,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:37,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1435356449, now seen corresponding path program 1 times [2018-11-18 17:16:37,270 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:37,271 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:37,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:37,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:37,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:37,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:37,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:16:37,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:16:37,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:16:37,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:37,446 INFO L87 Difference]: Start difference. First operand 594 states and 710 transitions. Second operand 6 states. [2018-11-18 17:16:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:37,514 INFO L93 Difference]: Finished difference Result 1174 states and 1405 transitions. [2018-11-18 17:16:37,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:16:37,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-18 17:16:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:37,518 INFO L225 Difference]: With dead ends: 1174 [2018-11-18 17:16:37,519 INFO L226 Difference]: Without dead ends: 594 [2018-11-18 17:16:37,520 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:16:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-18 17:16:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2018-11-18 17:16:37,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-18 17:16:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 709 transitions. [2018-11-18 17:16:37,548 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 709 transitions. Word has length 48 [2018-11-18 17:16:37,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:37,548 INFO L480 AbstractCegarLoop]: Abstraction has 594 states and 709 transitions. [2018-11-18 17:16:37,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:16:37,548 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 709 transitions. [2018-11-18 17:16:37,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-18 17:16:37,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:37,550 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:37,550 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:37,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:37,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2015605345, now seen corresponding path program 1 times [2018-11-18 17:16:37,551 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:37,551 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:37,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:37,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:37,709 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:37,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:37,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:16:37,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:16:37,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:16:37,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:37,712 INFO L87 Difference]: Start difference. First operand 594 states and 709 transitions. Second operand 3 states. [2018-11-18 17:16:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:37,755 INFO L93 Difference]: Finished difference Result 1209 states and 1462 transitions. [2018-11-18 17:16:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:16:37,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-18 17:16:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:37,759 INFO L225 Difference]: With dead ends: 1209 [2018-11-18 17:16:37,759 INFO L226 Difference]: Without dead ends: 633 [2018-11-18 17:16:37,761 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-11-18 17:16:37,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2018-11-18 17:16:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-11-18 17:16:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 759 transitions. [2018-11-18 17:16:37,790 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 759 transitions. Word has length 48 [2018-11-18 17:16:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:37,790 INFO L480 AbstractCegarLoop]: Abstraction has 633 states and 759 transitions. [2018-11-18 17:16:37,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:16:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 759 transitions. [2018-11-18 17:16:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 17:16:37,792 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:37,792 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-18 17:16:37,793 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:37,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:37,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1799634123, now seen corresponding path program 1 times [2018-11-18 17:16:37,794 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:37,794 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:37,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:37,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:16:37,977 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:37,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:37,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:37,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:37,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:37,980 INFO L87 Difference]: Start difference. First operand 633 states and 759 transitions. Second operand 5 states. [2018-11-18 17:16:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:40,084 INFO L93 Difference]: Finished difference Result 1286 states and 1541 transitions. [2018-11-18 17:16:40,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:40,085 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-11-18 17:16:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:40,089 INFO L225 Difference]: With dead ends: 1286 [2018-11-18 17:16:40,090 INFO L226 Difference]: Without dead ends: 668 [2018-11-18 17:16:40,092 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-11-18 17:16:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 645. [2018-11-18 17:16:40,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-11-18 17:16:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 769 transitions. [2018-11-18 17:16:40,128 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 769 transitions. Word has length 67 [2018-11-18 17:16:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:40,128 INFO L480 AbstractCegarLoop]: Abstraction has 645 states and 769 transitions. [2018-11-18 17:16:40,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:40,129 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 769 transitions. [2018-11-18 17:16:40,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-18 17:16:40,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:40,131 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:40,131 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:40,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:40,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1925760965, now seen corresponding path program 1 times [2018-11-18 17:16:40,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:40,134 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:40,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:40,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:40,478 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:40,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:40,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:16:40,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:16:40,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:16:40,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:40,486 INFO L87 Difference]: Start difference. First operand 645 states and 769 transitions. Second operand 6 states. [2018-11-18 17:16:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:40,588 INFO L93 Difference]: Finished difference Result 1297 states and 1557 transitions. [2018-11-18 17:16:40,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:16:40,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-11-18 17:16:40,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:40,594 INFO L225 Difference]: With dead ends: 1297 [2018-11-18 17:16:40,594 INFO L226 Difference]: Without dead ends: 666 [2018-11-18 17:16:40,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:16:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-18 17:16:40,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 660. [2018-11-18 17:16:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 17:16:40,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 782 transitions. [2018-11-18 17:16:40,626 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 782 transitions. Word has length 112 [2018-11-18 17:16:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:40,626 INFO L480 AbstractCegarLoop]: Abstraction has 660 states and 782 transitions. [2018-11-18 17:16:40,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:16:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 782 transitions. [2018-11-18 17:16:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 17:16:40,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:40,628 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:40,628 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:40,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash 702752190, now seen corresponding path program 1 times [2018-11-18 17:16:40,630 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:40,630 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:40,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:41,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:41,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:41,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:41,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:41,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:41,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:41,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:41,116 INFO L87 Difference]: Start difference. First operand 660 states and 782 transitions. Second operand 5 states. [2018-11-18 17:16:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:41,201 INFO L93 Difference]: Finished difference Result 1313 states and 1570 transitions. [2018-11-18 17:16:41,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:41,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-11-18 17:16:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:41,204 INFO L225 Difference]: With dead ends: 1313 [2018-11-18 17:16:41,205 INFO L226 Difference]: Without dead ends: 652 [2018-11-18 17:16:41,206 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-11-18 17:16:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2018-11-18 17:16:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2018-11-18 17:16:41,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 766 transitions. [2018-11-18 17:16:41,225 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 766 transitions. Word has length 118 [2018-11-18 17:16:41,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:41,225 INFO L480 AbstractCegarLoop]: Abstraction has 652 states and 766 transitions. [2018-11-18 17:16:41,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:41,226 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 766 transitions. [2018-11-18 17:16:41,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-18 17:16:41,226 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:41,227 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:41,227 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:41,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:41,227 INFO L82 PathProgramCache]: Analyzing trace with hash -43776603, now seen corresponding path program 1 times [2018-11-18 17:16:41,228 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:41,228 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:41,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:41,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:41,669 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:41,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:41,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:41,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:41,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:41,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:41,674 INFO L87 Difference]: Start difference. First operand 652 states and 766 transitions. Second operand 5 states. [2018-11-18 17:16:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:41,715 INFO L93 Difference]: Finished difference Result 990 states and 1169 transitions. [2018-11-18 17:16:41,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:41,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-11-18 17:16:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:41,718 INFO L225 Difference]: With dead ends: 990 [2018-11-18 17:16:41,718 INFO L226 Difference]: Without dead ends: 660 [2018-11-18 17:16:41,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:41,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-11-18 17:16:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-18 17:16:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-18 17:16:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 774 transitions. [2018-11-18 17:16:41,740 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 774 transitions. Word has length 118 [2018-11-18 17:16:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:41,741 INFO L480 AbstractCegarLoop]: Abstraction has 660 states and 774 transitions. [2018-11-18 17:16:41,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 774 transitions. [2018-11-18 17:16:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 17:16:41,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:41,742 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:41,742 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:41,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:41,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1959792815, now seen corresponding path program 1 times [2018-11-18 17:16:41,743 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:41,743 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:41,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:42,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:42,263 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:42,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:42,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:42,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:42,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:42,267 INFO L87 Difference]: Start difference. First operand 660 states and 774 transitions. Second operand 5 states. [2018-11-18 17:16:42,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:42,306 INFO L93 Difference]: Finished difference Result 1128 states and 1327 transitions. [2018-11-18 17:16:42,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:42,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2018-11-18 17:16:42,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:42,309 INFO L225 Difference]: With dead ends: 1128 [2018-11-18 17:16:42,309 INFO L226 Difference]: Without dead ends: 487 [2018-11-18 17:16:42,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2018-11-18 17:16:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2018-11-18 17:16:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-11-18 17:16:42,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 564 transitions. [2018-11-18 17:16:42,325 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 564 transitions. Word has length 124 [2018-11-18 17:16:42,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:42,326 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 564 transitions. [2018-11-18 17:16:42,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 564 transitions. [2018-11-18 17:16:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-18 17:16:42,327 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:42,328 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:42,328 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:42,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:42,328 INFO L82 PathProgramCache]: Analyzing trace with hash -117416528, now seen corresponding path program 1 times [2018-11-18 17:16:42,329 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:42,329 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:42,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:42,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:42,832 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:42,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:42,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:16:42,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:16:42,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:16:42,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:42,837 INFO L87 Difference]: Start difference. First operand 487 states and 564 transitions. Second operand 6 states. [2018-11-18 17:16:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:50,256 INFO L93 Difference]: Finished difference Result 1505 states and 1767 transitions. [2018-11-18 17:16:50,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:16:50,258 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2018-11-18 17:16:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:50,264 INFO L225 Difference]: With dead ends: 1505 [2018-11-18 17:16:50,264 INFO L226 Difference]: Without dead ends: 1150 [2018-11-18 17:16:50,266 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:16:50,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2018-11-18 17:16:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 970. [2018-11-18 17:16:50,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2018-11-18 17:16:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1132 transitions. [2018-11-18 17:16:50,322 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1132 transitions. Word has length 124 [2018-11-18 17:16:50,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:50,323 INFO L480 AbstractCegarLoop]: Abstraction has 970 states and 1132 transitions. [2018-11-18 17:16:50,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:16:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1132 transitions. [2018-11-18 17:16:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 17:16:50,326 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:50,326 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:50,326 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:50,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1721287175, now seen corresponding path program 1 times [2018-11-18 17:16:50,327 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:50,328 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:50,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:50,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:50,632 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:50,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:50,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:16:50,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:16:50,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:16:50,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:16:50,636 INFO L87 Difference]: Start difference. First operand 970 states and 1132 transitions. Second operand 6 states. [2018-11-18 17:16:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:52,720 INFO L93 Difference]: Finished difference Result 1140 states and 1316 transitions. [2018-11-18 17:16:52,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:16:52,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-11-18 17:16:52,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:52,722 INFO L225 Difference]: With dead ends: 1140 [2018-11-18 17:16:52,722 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 17:16:52,724 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:16:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 17:16:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-11-18 17:16:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-11-18 17:16:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2018-11-18 17:16:52,736 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 127 [2018-11-18 17:16:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:52,737 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2018-11-18 17:16:52,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:16:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2018-11-18 17:16:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-18 17:16:52,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:52,739 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:52,739 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:52,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:52,739 INFO L82 PathProgramCache]: Analyzing trace with hash -314635718, now seen corresponding path program 1 times [2018-11-18 17:16:52,740 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:52,740 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:52,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:53,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:53,284 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:53,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:53,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:16:53,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:16:53,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:16:53,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:53,288 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand 3 states. [2018-11-18 17:16:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:53,302 INFO L93 Difference]: Finished difference Result 178 states and 184 transitions. [2018-11-18 17:16:53,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:16:53,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-11-18 17:16:53,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:53,304 INFO L225 Difference]: With dead ends: 178 [2018-11-18 17:16:53,304 INFO L226 Difference]: Without dead ends: 134 [2018-11-18 17:16:53,305 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:16:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-18 17:16:53,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-11-18 17:16:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-18 17:16:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2018-11-18 17:16:53,313 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 137 [2018-11-18 17:16:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:53,314 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2018-11-18 17:16:53,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:16:53,314 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2018-11-18 17:16:53,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-11-18 17:16:53,315 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:16:53,315 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:16:53,316 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:16:53,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:16:53,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2083775541, now seen corresponding path program 1 times [2018-11-18 17:16:53,319 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:16:53,319 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:16:53,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:16:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:16:53,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:16:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 17:16:53,906 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:16:53,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:16:53,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:16:53,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:16:53,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:16:53,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:53,909 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand 5 states. [2018-11-18 17:16:53,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:16:53,922 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2018-11-18 17:16:53,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:16:53,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2018-11-18 17:16:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:16:53,923 INFO L225 Difference]: With dead ends: 134 [2018-11-18 17:16:53,923 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:16:53,923 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:16:53,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:16:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:16:53,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:16:53,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:16:53,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2018-11-18 17:16:53,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:16:53,924 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:16:53,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:16:53,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:16:53,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:16:53,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:16:55,242 INFO L425 ceAbstractionStarter]: For program point L3521(lines 3521 3528) no Hoare annotation was computed. [2018-11-18 17:16:55,242 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3508 3532) no Hoare annotation was computed. [2018-11-18 17:16:55,242 INFO L425 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3508 3532) no Hoare annotation was computed. [2018-11-18 17:16:55,242 INFO L425 ceAbstractionStarter]: For program point L3524(lines 3524 3528) no Hoare annotation was computed. [2018-11-18 17:16:55,242 INFO L428 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3508 3532) the Hoare annotation is: true [2018-11-18 17:16:55,243 INFO L425 ceAbstractionStarter]: For program point L3524-2(lines 3521 3528) no Hoare annotation was computed. [2018-11-18 17:16:55,243 INFO L425 ceAbstractionStarter]: For program point L4127-1(line 4127) no Hoare annotation was computed. [2018-11-18 17:16:55,243 INFO L421 ceAbstractionStarter]: At program point L4127(line 4127) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,243 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4063 4154) no Hoare annotation was computed. [2018-11-18 17:16:55,243 INFO L425 ceAbstractionStarter]: For program point L4111-1(line 4111) no Hoare annotation was computed. [2018-11-18 17:16:55,243 INFO L421 ceAbstractionStarter]: At program point L4111(line 4111) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= main_~ldv_s_usb_mouse_driver_usb_driver~0 (_ bv0 32)))) [2018-11-18 17:16:55,243 INFO L425 ceAbstractionStarter]: For program point L4103(lines 4103 4139) no Hoare annotation was computed. [2018-11-18 17:16:55,243 INFO L421 ceAbstractionStarter]: At program point L4141(lines 4083 4142) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,243 INFO L425 ceAbstractionStarter]: For program point L4075-1(line 4075) no Hoare annotation was computed. [2018-11-18 17:16:55,243 INFO L421 ceAbstractionStarter]: At program point L4075(line 4075) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-18 17:16:55,243 INFO L421 ceAbstractionStarter]: At program point L4104(lines 4103 4139) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= main_~ldv_s_usb_mouse_driver_usb_driver~0 (_ bv0 32)))) [2018-11-18 17:16:55,243 INFO L421 ceAbstractionStarter]: At program point L4137(lines 4084 4140) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= main_~ldv_s_usb_mouse_driver_usb_driver~0 (_ bv0 32)))) [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point L4100(lines 4100 4139) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point L4092(lines 4092 4096) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point L4092-1(lines 4089 4096) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point L4150(line 4150) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L421 ceAbstractionStarter]: At program point L4146(lines 4071 4153) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point L4084-1(lines 4084 4140) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 4107 4138) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4063 4154) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 4107 4138) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L421 ceAbstractionStarter]: At program point L4101(lines 4100 4139) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= main_~ldv_s_usb_mouse_driver_usb_driver~0 (_ bv0 32)))) [2018-11-18 17:16:55,244 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 4063 4154) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point L4089(lines 4089 4096) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point L4085(line 4085) no Hoare annotation was computed. [2018-11-18 17:16:55,244 INFO L425 ceAbstractionStarter]: For program point L4114(lines 4114 4118) no Hoare annotation was computed. [2018-11-18 17:16:55,245 INFO L425 ceAbstractionStarter]: For program point L4077(lines 4077 4081) no Hoare annotation was computed. [2018-11-18 17:16:55,245 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3450 3459) no Hoare annotation was computed. [2018-11-18 17:16:55,245 INFO L428 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3450 3459) the Hoare annotation is: true [2018-11-18 17:16:55,245 INFO L425 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3450 3459) no Hoare annotation was computed. [2018-11-18 17:16:55,245 INFO L428 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3659 3669) the Hoare annotation is: true [2018-11-18 17:16:55,245 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3659 3669) no Hoare annotation was computed. [2018-11-18 17:16:55,245 INFO L425 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3659 3669) no Hoare annotation was computed. [2018-11-18 17:16:55,245 INFO L428 ceAbstractionStarter]: At program point L3400(line 3400) the Hoare annotation is: true [2018-11-18 17:16:55,245 INFO L425 ceAbstractionStarter]: For program point kzallocEXIT(lines 3395 3404) no Hoare annotation was computed. [2018-11-18 17:16:55,245 INFO L425 ceAbstractionStarter]: For program point L3400-1(line 3400) no Hoare annotation was computed. [2018-11-18 17:16:55,245 INFO L428 ceAbstractionStarter]: At program point kzallocENTRY(lines 3395 3404) the Hoare annotation is: true [2018-11-18 17:16:55,245 INFO L425 ceAbstractionStarter]: For program point kzallocFINAL(lines 3395 3404) no Hoare annotation was computed. [2018-11-18 17:16:55,246 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopFINAL(lines 4165 4172) no Hoare annotation was computed. [2018-11-18 17:16:55,246 INFO L428 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4165 4172) the Hoare annotation is: true [2018-11-18 17:16:55,246 INFO L425 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4165 4172) no Hoare annotation was computed. [2018-11-18 17:16:55,246 INFO L428 ceAbstractionStarter]: At program point kmallocENTRY(lines 3384 3394) the Hoare annotation is: true [2018-11-18 17:16:55,246 INFO L425 ceAbstractionStarter]: For program point kmallocFINAL(lines 3384 3394) no Hoare annotation was computed. [2018-11-18 17:16:55,246 INFO L425 ceAbstractionStarter]: For program point kmallocEXIT(lines 3384 3394) no Hoare annotation was computed. [2018-11-18 17:16:55,246 INFO L425 ceAbstractionStarter]: For program point usb_endpoint_dir_inEXIT(lines 3408 3414) no Hoare annotation was computed. [2018-11-18 17:16:55,246 INFO L428 ceAbstractionStarter]: At program point usb_endpoint_dir_inENTRY(lines 3408 3414) the Hoare annotation is: true [2018-11-18 17:16:55,246 INFO L425 ceAbstractionStarter]: For program point usb_endpoint_dir_inFINAL(lines 3408 3414) no Hoare annotation was computed. [2018-11-18 17:16:55,246 INFO L425 ceAbstractionStarter]: For program point L4212(lines 4211 4233) no Hoare annotation was computed. [2018-11-18 17:16:55,246 INFO L421 ceAbstractionStarter]: At program point usb_free_coherentENTRY(lines 4206 4239) the Hoare annotation is: (or (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:16:55,247 INFO L425 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4206 4239) no Hoare annotation was computed. [2018-11-18 17:16:55,247 INFO L421 ceAbstractionStarter]: At program point L4225(line 4225) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:16:55,247 INFO L425 ceAbstractionStarter]: For program point L4225-1(lines 4221 4227) no Hoare annotation was computed. [2018-11-18 17:16:55,247 INFO L425 ceAbstractionStarter]: For program point L4221(lines 4221 4227) no Hoare annotation was computed. [2018-11-18 17:16:55,247 INFO L428 ceAbstractionStarter]: At program point L4215(line 4215) the Hoare annotation is: true [2018-11-18 17:16:55,247 INFO L421 ceAbstractionStarter]: At program point L4211loopEntry(lines 4211 4233) the Hoare annotation is: (or (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:16:55,247 INFO L425 ceAbstractionStarter]: For program point L4211-1(lines 4211 4233) no Hoare annotation was computed. [2018-11-18 17:16:55,247 INFO L425 ceAbstractionStarter]: For program point L4213(lines 4211 4233) no Hoare annotation was computed. [2018-11-18 17:16:55,247 INFO L421 ceAbstractionStarter]: At program point L4234(lines 4206 4239) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_coherent_state~0)|)) (= (_ bv0 32) ~ldv_coherent_state~0) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:16:55,247 INFO L425 ceAbstractionStarter]: For program point usb_endpoint_is_int_inFINAL(lines 3422 3445) no Hoare annotation was computed. [2018-11-18 17:16:55,247 INFO L425 ceAbstractionStarter]: For program point L3435(lines 3435 3439) no Hoare annotation was computed. [2018-11-18 17:16:55,247 INFO L425 ceAbstractionStarter]: For program point usb_endpoint_is_int_inEXIT(lines 3422 3445) no Hoare annotation was computed. [2018-11-18 17:16:55,248 INFO L425 ceAbstractionStarter]: For program point L3433-1(line 3433) no Hoare annotation was computed. [2018-11-18 17:16:55,248 INFO L428 ceAbstractionStarter]: At program point L3433(line 3433) the Hoare annotation is: true [2018-11-18 17:16:55,248 INFO L425 ceAbstractionStarter]: For program point L3431-1(lines 3431 3442) no Hoare annotation was computed. [2018-11-18 17:16:55,248 INFO L428 ceAbstractionStarter]: At program point usb_endpoint_is_int_inENTRY(lines 3422 3445) the Hoare annotation is: true [2018-11-18 17:16:55,248 INFO L425 ceAbstractionStarter]: For program point L3431(lines 3431 3442) no Hoare annotation was computed. [2018-11-18 17:16:55,248 INFO L425 ceAbstractionStarter]: For program point L3429-1(line 3429) no Hoare annotation was computed. [2018-11-18 17:16:55,248 INFO L428 ceAbstractionStarter]: At program point L3429(line 3429) the Hoare annotation is: true [2018-11-18 17:16:55,248 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4177 4204) no Hoare annotation was computed. [2018-11-18 17:16:55,248 INFO L425 ceAbstractionStarter]: For program point L4190(lines 4190 4194) no Hoare annotation was computed. [2018-11-18 17:16:55,248 INFO L421 ceAbstractionStarter]: At program point L4184loopEntry(lines 4184 4198) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) ~ldv_urb_state~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) [2018-11-18 17:16:55,248 INFO L421 ceAbstractionStarter]: At program point usb_alloc_coherentENTRY(lines 4177 4204) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) ~ldv_urb_state~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) [2018-11-18 17:16:55,248 INFO L425 ceAbstractionStarter]: For program point L4185(line 4185) no Hoare annotation was computed. [2018-11-18 17:16:55,249 INFO L425 ceAbstractionStarter]: For program point L4184-1(lines 4184 4198) no Hoare annotation was computed. [2018-11-18 17:16:55,249 INFO L425 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4177 4204) no Hoare annotation was computed. [2018-11-18 17:16:55,249 INFO L425 ceAbstractionStarter]: For program point L4199(lines 4183 4200) no Hoare annotation was computed. [2018-11-18 17:16:55,249 INFO L425 ceAbstractionStarter]: For program point L4015(lines 4015 4021) no Hoare annotation was computed. [2018-11-18 17:16:55,249 INFO L428 ceAbstractionStarter]: At program point L4012(line 4012) the Hoare annotation is: true [2018-11-18 17:16:55,249 INFO L425 ceAbstractionStarter]: For program point L4015-2(lines 4015 4021) no Hoare annotation was computed. [2018-11-18 17:16:55,249 INFO L425 ceAbstractionStarter]: For program point L4012-1(line 4012) no Hoare annotation was computed. [2018-11-18 17:16:55,249 INFO L425 ceAbstractionStarter]: For program point usb_mouse_initEXIT(lines 4006 4024) no Hoare annotation was computed. [2018-11-18 17:16:55,249 INFO L428 ceAbstractionStarter]: At program point usb_mouse_initENTRY(lines 4006 4024) the Hoare annotation is: true [2018-11-18 17:16:55,249 INFO L425 ceAbstractionStarter]: For program point usb_mouse_initFINAL(lines 4006 4024) no Hoare annotation was computed. [2018-11-18 17:16:55,249 INFO L428 ceAbstractionStarter]: At program point usb_endpoint_xfer_intENTRY(lines 3415 3421) the Hoare annotation is: true [2018-11-18 17:16:55,249 INFO L425 ceAbstractionStarter]: For program point usb_endpoint_xfer_intFINAL(lines 3415 3421) no Hoare annotation was computed. [2018-11-18 17:16:55,250 INFO L425 ceAbstractionStarter]: For program point usb_endpoint_xfer_intEXIT(lines 3415 3421) no Hoare annotation was computed. [2018-11-18 17:16:55,250 INFO L428 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3462 3471) the Hoare annotation is: true [2018-11-18 17:16:55,250 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3462 3471) no Hoare annotation was computed. [2018-11-18 17:16:55,250 INFO L425 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3462 3471) no Hoare annotation was computed. [2018-11-18 17:16:55,250 INFO L428 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3613 3622) the Hoare annotation is: true [2018-11-18 17:16:55,250 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3613 3622) no Hoare annotation was computed. [2018-11-18 17:16:55,250 INFO L425 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3613 3622) no Hoare annotation was computed. [2018-11-18 17:16:55,250 INFO L425 ceAbstractionStarter]: For program point L4288-1(lines 4284 4290) no Hoare annotation was computed. [2018-11-18 17:16:55,250 INFO L428 ceAbstractionStarter]: At program point L4288(line 4288) the Hoare annotation is: true [2018-11-18 17:16:55,250 INFO L425 ceAbstractionStarter]: For program point L4284(lines 4284 4290) no Hoare annotation was computed. [2018-11-18 17:16:55,250 INFO L428 ceAbstractionStarter]: At program point L4278(line 4278) the Hoare annotation is: true [2018-11-18 17:16:55,250 INFO L428 ceAbstractionStarter]: At program point L4274loopEntry(lines 4274 4296) the Hoare annotation is: true [2018-11-18 17:16:55,251 INFO L425 ceAbstractionStarter]: For program point L4276(lines 4274 4296) no Hoare annotation was computed. [2018-11-18 17:16:55,251 INFO L425 ceAbstractionStarter]: For program point L4274-1(lines 4274 4296) no Hoare annotation was computed. [2018-11-18 17:16:55,251 INFO L428 ceAbstractionStarter]: At program point L4297(lines 4269 4302) the Hoare annotation is: true [2018-11-18 17:16:55,251 INFO L425 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4269 4302) no Hoare annotation was computed. [2018-11-18 17:16:55,251 INFO L428 ceAbstractionStarter]: At program point usb_free_urbENTRY(lines 4269 4302) the Hoare annotation is: true [2018-11-18 17:16:55,251 INFO L425 ceAbstractionStarter]: For program point L4275(lines 4274 4296) no Hoare annotation was computed. [2018-11-18 17:16:55,251 INFO L425 ceAbstractionStarter]: For program point L3937-1(line 3937) no Hoare annotation was computed. [2018-11-18 17:16:55,251 INFO L421 ceAbstractionStarter]: At program point L3937(line 3937) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,251 INFO L425 ceAbstractionStarter]: For program point L3863(lines 3863 3867) no Hoare annotation was computed. [2018-11-18 17:16:55,251 INFO L425 ceAbstractionStarter]: For program point L3855(lines 3855 3859) no Hoare annotation was computed. [2018-11-18 17:16:55,251 INFO L421 ceAbstractionStarter]: At program point L3946(line 3946) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (exists ((usb_mouse_probe_~tmp___9~0 (_ BitVec 32))) (= (bvor (_ bv1073741952 32) usb_mouse_probe_~tmp___9~0) usb_mouse_probe_~pipe~0)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,251 INFO L425 ceAbstractionStarter]: For program point L3946-1(line 3946) no Hoare annotation was computed. [2018-11-18 17:16:55,252 INFO L421 ceAbstractionStarter]: At program point L3942(line 3942) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,252 INFO L425 ceAbstractionStarter]: For program point L3942-1(line 3942) no Hoare annotation was computed. [2018-11-18 17:16:55,252 INFO L425 ceAbstractionStarter]: For program point L3843(lines 3843 3850) no Hoare annotation was computed. [2018-11-18 17:16:55,252 INFO L425 ceAbstractionStarter]: For program point L3839-1(line 3839) no Hoare annotation was computed. [2018-11-18 17:16:55,252 INFO L421 ceAbstractionStarter]: At program point L3839(line 3839) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (exists ((usb_mouse_probe_~tmp___9~0 (_ BitVec 32))) (= (bvor (_ bv1073741952 32) usb_mouse_probe_~tmp___9~0) usb_mouse_probe_~pipe~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,252 INFO L425 ceAbstractionStarter]: For program point usb_mouse_probeFINAL(lines 3794 3955) no Hoare annotation was computed. [2018-11-18 17:16:55,252 INFO L425 ceAbstractionStarter]: For program point L3835-1(line 3835) no Hoare annotation was computed. [2018-11-18 17:16:55,252 INFO L421 ceAbstractionStarter]: At program point L3835(line 3835) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,252 INFO L425 ceAbstractionStarter]: For program point L3827-1(line 3827) no Hoare annotation was computed. [2018-11-18 17:16:55,253 INFO L421 ceAbstractionStarter]: At program point L3827(line 3827) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,253 INFO L425 ceAbstractionStarter]: For program point L3918(lines 3918 3922) no Hoare annotation was computed. [2018-11-18 17:16:55,253 INFO L421 ceAbstractionStarter]: At program point L3852(line 3852) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (exists ((usb_mouse_probe_~tmp___9~0 (_ BitVec 32))) (= (bvor (_ bv1073741952 32) usb_mouse_probe_~tmp___9~0) usb_mouse_probe_~pipe~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,253 INFO L425 ceAbstractionStarter]: For program point L3918-2(lines 3918 3922) no Hoare annotation was computed. [2018-11-18 17:16:55,253 INFO L421 ceAbstractionStarter]: At program point usb_mouse_probeENTRY(lines 3794 3955) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-18 17:16:55,253 INFO L421 ceAbstractionStarter]: At program point L3914(line 3914) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,253 INFO L425 ceAbstractionStarter]: For program point L3852-1(line 3852) no Hoare annotation was computed. [2018-11-18 17:16:55,253 INFO L425 ceAbstractionStarter]: For program point L3914-1(line 3914) no Hoare annotation was computed. [2018-11-18 17:16:55,253 INFO L425 ceAbstractionStarter]: For program point usb_mouse_probeEXIT(lines 3794 3955) no Hoare annotation was computed. [2018-11-18 17:16:55,253 INFO L425 ceAbstractionStarter]: For program point L3815-1(line 3815) no Hoare annotation was computed. [2018-11-18 17:16:55,254 INFO L421 ceAbstractionStarter]: At program point L3815(line 3815) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0))) [2018-11-18 17:16:55,254 INFO L425 ceAbstractionStarter]: For program point L3877(lines 3877 3890) no Hoare annotation was computed. [2018-11-18 17:16:55,254 INFO L425 ceAbstractionStarter]: For program point L3877-2(lines 3877 3890) no Hoare annotation was computed. [2018-11-18 17:16:55,254 INFO L425 ceAbstractionStarter]: For program point L3931(lines 3931 3935) no Hoare annotation was computed. [2018-11-18 17:16:55,254 INFO L425 ceAbstractionStarter]: For program point L3894(lines 3894 3901) no Hoare annotation was computed. [2018-11-18 17:16:55,254 INFO L425 ceAbstractionStarter]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2018-11-18 17:16:55,254 INFO L428 ceAbstractionStarter]: At program point L3894-2(lines 3894 3901) the Hoare annotation is: true [2018-11-18 17:16:55,254 INFO L421 ceAbstractionStarter]: At program point L3861(line 3861) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (exists ((usb_mouse_probe_~tmp___9~0 (_ BitVec 32))) (= (bvor (_ bv1073741952 32) usb_mouse_probe_~tmp___9~0) usb_mouse_probe_~pipe~0)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,254 INFO L425 ceAbstractionStarter]: For program point L3820(lines 3820 3824) no Hoare annotation was computed. [2018-11-18 17:16:55,255 INFO L421 ceAbstractionStarter]: At program point L3948(lines 3813 3954) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (exists ((usb_mouse_probe_~tmp___9~0 (_ BitVec 32))) (= (bvor (_ bv1073741952 32) usb_mouse_probe_~tmp___9~0) usb_mouse_probe_~pipe~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,255 INFO L421 ceAbstractionStarter]: At program point L3944(lines 3813 3954) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (exists ((usb_mouse_probe_~tmp___9~0 (_ BitVec 32))) (= (bvor (_ bv1073741952 32) usb_mouse_probe_~tmp___9~0) usb_mouse_probe_~pipe~0)) (= (bvadd |old(~ldv_coherent_state~0)| (_ bv1 32)) ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,255 INFO L425 ceAbstractionStarter]: For program point L3878(lines 3878 3884) no Hoare annotation was computed. [2018-11-18 17:16:55,255 INFO L425 ceAbstractionStarter]: For program point L3878-2(lines 3878 3884) no Hoare annotation was computed. [2018-11-18 17:16:55,255 INFO L425 ceAbstractionStarter]: For program point L3907-1(line 3907) no Hoare annotation was computed. [2018-11-18 17:16:55,255 INFO L428 ceAbstractionStarter]: At program point L3907(line 3907) the Hoare annotation is: true [2018-11-18 17:16:55,255 INFO L425 ceAbstractionStarter]: For program point L3841-1(line 3841) no Hoare annotation was computed. [2018-11-18 17:16:55,255 INFO L421 ceAbstractionStarter]: At program point L3841(line 3841) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (exists ((usb_mouse_probe_~tmp___9~0 (_ BitVec 32))) (= (bvor (_ bv1073741952 32) usb_mouse_probe_~tmp___9~0) usb_mouse_probe_~pipe~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,255 INFO L425 ceAbstractionStarter]: For program point L3870(lines 3870 3876) no Hoare annotation was computed. [2018-11-18 17:16:55,256 INFO L425 ceAbstractionStarter]: For program point L3903(line 3903) no Hoare annotation was computed. [2018-11-18 17:16:55,256 INFO L425 ceAbstractionStarter]: For program point L3837-1(line 3837) no Hoare annotation was computed. [2018-11-18 17:16:55,256 INFO L425 ceAbstractionStarter]: For program point L3870-2(lines 3870 3876) no Hoare annotation was computed. [2018-11-18 17:16:55,256 INFO L421 ceAbstractionStarter]: At program point L3932(lines 3813 3954) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,256 INFO L421 ceAbstractionStarter]: At program point L3837(line 3837) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (and (= ~ldv_urb_state~0 (_ bv0 32)) (exists ((usb_mouse_probe_~tmp___9~0 (_ BitVec 32))) (= (bvor (_ bv1073741952 32) usb_mouse_probe_~tmp___9~0) usb_mouse_probe_~pipe~0)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= (bvadd usb_mouse_probe_~error~0 (_ bv12 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,256 INFO L425 ceAbstractionStarter]: For program point L3829-1(lines 3829 3833) no Hoare annotation was computed. [2018-11-18 17:16:55,256 INFO L421 ceAbstractionStarter]: At program point L3924(lines 3924 3925) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_coherent_state~0)|)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,256 INFO L425 ceAbstractionStarter]: For program point L3829(lines 3829 3833) no Hoare annotation was computed. [2018-11-18 17:16:55,256 INFO L425 ceAbstractionStarter]: For program point L3924-1(lines 3924 3925) no Hoare annotation was computed. [2018-11-18 17:16:55,256 INFO L425 ceAbstractionStarter]: For program point L3846(lines 3846 3850) no Hoare annotation was computed. [2018-11-18 17:16:55,256 INFO L425 ceAbstractionStarter]: For program point L3488(lines 3488 3492) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L425 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3480 3495) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L425 ceAbstractionStarter]: For program point L3488-2(lines 3488 3492) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L428 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3480 3495) the Hoare annotation is: true [2018-11-18 17:16:55,257 INFO L425 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3480 3495) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L428 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3540 3546) the Hoare annotation is: true [2018-11-18 17:16:55,257 INFO L425 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3540 3546) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L425 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3540 3546) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L425 ceAbstractionStarter]: For program point L3599(line 3599) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3598 3600) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L428 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3598 3600) the Hoare annotation is: true [2018-11-18 17:16:55,257 INFO L425 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3598 3600) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:16:55,257 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point L3578(lines 3578 3584) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point L3578-2(lines 3578 3584) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L428 ceAbstractionStarter]: At program point usb_maxpacketENTRY(lines 3547 3597) the Hoare annotation is: true [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point usb_maxpacketEXIT(lines 3547 3597) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point L3562(lines 3562 3568) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point L3562-2(lines 3562 3568) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point L3557(lines 3557 3589) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point usb_maxpacketFINAL(lines 3547 3597) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point L3557-2(lines 3555 3596) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3472 3479) no Hoare annotation was computed. [2018-11-18 17:16:55,258 INFO L428 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3472 3479) the Hoare annotation is: true [2018-11-18 17:16:55,259 INFO L425 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3472 3479) no Hoare annotation was computed. [2018-11-18 17:16:55,259 INFO L428 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4304 4324) the Hoare annotation is: true [2018-11-18 17:16:55,259 INFO L421 ceAbstractionStarter]: At program point L4319(line 4319) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:16:55,259 INFO L425 ceAbstractionStarter]: For program point L4319-1(lines 4304 4324) no Hoare annotation was computed. [2018-11-18 17:16:55,259 INFO L425 ceAbstractionStarter]: For program point L4312-1(lines 4307 4323) no Hoare annotation was computed. [2018-11-18 17:16:55,259 INFO L421 ceAbstractionStarter]: At program point L4312(line 4312) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) ~ldv_urb_state~0))) [2018-11-18 17:16:55,259 INFO L425 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4304 4324) no Hoare annotation was computed. [2018-11-18 17:16:55,259 INFO L421 ceAbstractionStarter]: At program point usb_alloc_urbENTRY(lines 4241 4267) the Hoare annotation is: (or (= ~ldv_urb_state~0 (_ bv0 32)) (not (= (_ bv1 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,259 INFO L425 ceAbstractionStarter]: For program point L4253(lines 4253 4257) no Hoare annotation was computed. [2018-11-18 17:16:55,259 INFO L421 ceAbstractionStarter]: At program point L4247loopEntry(lines 4247 4261) the Hoare annotation is: (or (= ~ldv_urb_state~0 (_ bv0 32)) (not (= (_ bv1 32) ~ldv_coherent_state~0)) (not (= (_ bv0 32) |old(~ldv_urb_state~0)|))) [2018-11-18 17:16:55,259 INFO L425 ceAbstractionStarter]: For program point L4247-1(lines 4247 4261) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L425 ceAbstractionStarter]: For program point L4248(line 4248) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4241 4267) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L425 ceAbstractionStarter]: For program point L4262(lines 4246 4263) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L425 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4241 4267) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L428 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3497 3506) the Hoare annotation is: true [2018-11-18 17:16:55,260 INFO L425 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3497 3506) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L425 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3497 3506) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L425 ceAbstractionStarter]: For program point usb_mouse_exitEXIT(lines 4027 4036) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L428 ceAbstractionStarter]: At program point usb_mouse_exitENTRY(lines 4027 4036) the Hoare annotation is: true [2018-11-18 17:16:55,260 INFO L425 ceAbstractionStarter]: For program point usb_mouse_exitFINAL(lines 4027 4036) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:16:55,260 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~ldv_urb_state~0 (_ bv0 32)) (= (_ bv0 32) ~ldv_coherent_state~0)) [2018-11-18 17:16:55,261 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:16:55,261 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:16:55,261 INFO L425 ceAbstractionStarter]: For program point L3967-1(lines 3956 3981) no Hoare annotation was computed. [2018-11-18 17:16:55,261 INFO L425 ceAbstractionStarter]: For program point L3965-1(lines 3961 3980) no Hoare annotation was computed. [2018-11-18 17:16:55,261 INFO L428 ceAbstractionStarter]: At program point L3965(line 3965) the Hoare annotation is: true [2018-11-18 17:16:55,261 INFO L425 ceAbstractionStarter]: For program point L3963-1(line 3963) no Hoare annotation was computed. [2018-11-18 17:16:55,261 INFO L428 ceAbstractionStarter]: At program point L3963(line 3963) the Hoare annotation is: true [2018-11-18 17:16:55,261 INFO L425 ceAbstractionStarter]: For program point usb_mouse_disconnectEXIT(lines 3956 3981) no Hoare annotation was computed. [2018-11-18 17:16:55,261 INFO L428 ceAbstractionStarter]: At program point usb_mouse_disconnectENTRY(lines 3956 3981) the Hoare annotation is: true [2018-11-18 17:16:55,261 INFO L428 ceAbstractionStarter]: At program point L3972(line 3972) the Hoare annotation is: true [2018-11-18 17:16:55,262 INFO L425 ceAbstractionStarter]: For program point L3973-1(line 3973) no Hoare annotation was computed. [2018-11-18 17:16:55,262 INFO L428 ceAbstractionStarter]: At program point L3973(line 3973) the Hoare annotation is: true [2018-11-18 17:16:55,262 INFO L425 ceAbstractionStarter]: For program point L3971-1(line 3971) no Hoare annotation was computed. [2018-11-18 17:16:55,262 INFO L428 ceAbstractionStarter]: At program point L3971(line 3971) the Hoare annotation is: true [2018-11-18 17:16:55,262 INFO L425 ceAbstractionStarter]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2018-11-18 17:16:55,262 INFO L428 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4155 4161) the Hoare annotation is: true [2018-11-18 17:16:55,262 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4159) no Hoare annotation was computed. [2018-11-18 17:16:55,262 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4155 4161) no Hoare annotation was computed. [2018-11-18 17:16:55,262 INFO L425 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4155 4161) no Hoare annotation was computed. [2018-11-18 17:16:55,276 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] [2018-11-18 17:16:55,277 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] [2018-11-18 17:16:55,280 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] [2018-11-18 17:16:55,281 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] [2018-11-18 17:16:55,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:16:55 BoogieIcfgContainer [2018-11-18 17:16:55,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:16:55,284 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:16:55,284 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:16:55,284 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:16:55,284 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:16:36" (3/4) ... [2018-11-18 17:16:55,288 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:16:55,306 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_fill_int_urb [2018-11-18 17:16:55,306 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:16:55,306 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_get_intfdata [2018-11-18 17:16:55,306 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_to_input_id [2018-11-18 17:16:55,306 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2018-11-18 17:16:55,306 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2018-11-18 17:16:55,306 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure kmalloc [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_endpoint_dir_in [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_endpoint_is_int_in [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_coherent [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_mouse_init [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_endpoint_xfer_int [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_drvdata [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_mouse_probe [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_make_path [2018-11-18 17:16:55,307 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __create_pipe [2018-11-18 17:16:55,308 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure input_allocate_device [2018-11-18 17:16:55,308 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:16:55,308 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_maxpacket [2018-11-18 17:16:55,308 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure interface_to_usbdev [2018-11-18 17:16:55,308 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-18 17:16:55,308 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_alloc_urb [2018-11-18 17:16:55,308 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_register [2018-11-18 17:16:55,308 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_mouse_exit [2018-11-18 17:16:55,309 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_mouse_disconnect [2018-11-18 17:16:55,309 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2018-11-18 17:16:55,327 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 158 nodes and edges [2018-11-18 17:16:55,328 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 67 nodes and edges [2018-11-18 17:16:55,335 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2018-11-18 17:16:55,335 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-11-18 17:16:55,336 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 17:16:55,337 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-18 17:16:55,337 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 17:16:55,360 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:16:55,360 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) [2018-11-18 17:16:55,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:16:55,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(1bv32 == \old(ldv_coherent_state)) || 0bv32 == ldv_coherent_state) || !(0bv32 == ldv_urb_state) [2018-11-18 17:16:55,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) [2018-11-18 17:16:55,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || (((ldv_urb_state == 0bv32 && (\exists usb_mouse_probe_~tmp___9~0 : bv32 :: ~bvor64(1073741952bv32, usb_mouse_probe_~tmp___9~0) == pipe)) && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && ~bvadd16(error, 12bv32) == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:16:55,361 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) [2018-11-18 17:16:55,362 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || (((ldv_urb_state == 0bv32 && (\exists usb_mouse_probe_~tmp___9~0 : bv32 :: ~bvor64(1073741952bv32, usb_mouse_probe_~tmp___9~0) == pipe)) && \old(ldv_coherent_state) == ldv_coherent_state) && ~bvadd16(error, 12bv32) == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:16:55,362 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\old(ldv_coherent_state) == ldv_coherent_state || !(1bv32 == \old(ldv_coherent_state))) || !(0bv32 == ldv_urb_state) [2018-11-18 17:16:55,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == ldv_urb_state)) || \old(ldv_coherent_state) == ldv_coherent_state [2018-11-18 17:16:55,364 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (ldv_urb_state == 0bv32 || !(1bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:16:55,366 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) [2018-11-18 17:16:55,420 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6186a565-22ff-46b3-9ba8-18d881a69a9f/bin-2019/utaipan/witness.graphml [2018-11-18 17:16:55,420 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:16:55,421 INFO L168 Benchmark]: Toolchain (without parser) took 24217.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.0 MB). Free memory was 942.5 MB in the beginning and 927.7 MB in the end (delta: 14.8 MB). Peak memory consumption was 392.8 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:55,422 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:16:55,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1634.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 942.5 MB in the beginning and 884.3 MB in the end (delta: 58.1 MB). Peak memory consumption was 267.7 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:55,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.28 ms. Allocated memory is still 1.2 GB. Free memory is still 884.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:16:55,422 INFO L168 Benchmark]: Boogie Preprocessor took 78.99 ms. Allocated memory is still 1.2 GB. Free memory was 884.3 MB in the beginning and 878.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:55,423 INFO L168 Benchmark]: RCFGBuilder took 3452.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.1 MB). Free memory was 878.5 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:55,423 INFO L168 Benchmark]: TraceAbstraction took 18865.37 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 945.9 MB in the end (delta: 131.4 MB). Peak memory consumption was 242.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:55,423 INFO L168 Benchmark]: Witness Printer took 136.42 ms. Allocated memory is still 1.4 GB. Free memory was 945.9 MB in the beginning and 927.7 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:16:55,425 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1634.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.8 MB). Free memory was 942.5 MB in the beginning and 884.3 MB in the end (delta: 58.1 MB). Peak memory consumption was 267.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.28 ms. Allocated memory is still 1.2 GB. Free memory is still 884.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.99 ms. Allocated memory is still 1.2 GB. Free memory was 884.3 MB in the beginning and 878.5 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3452.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 77.1 MB). Free memory was 878.5 MB in the beginning and 1.1 GB in the end (delta: -198.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18865.37 ms. Allocated memory was 1.3 GB in the beginning and 1.4 GB in the end (delta: 111.1 MB). Free memory was 1.1 GB in the beginning and 945.9 MB in the end (delta: 131.4 MB). Peak memory consumption was 242.6 MB. Max. memory is 11.5 GB. * Witness Printer took 136.42 ms. Allocated memory is still 1.4 GB. Free memory was 945.9 MB in the beginning and 927.7 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4159]: 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: 4084]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) - InvariantResult [Line: 3813]: Loop Invariant [2018-11-18 17:16:55,429 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] [2018-11-18 17:16:55,430 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || (((ldv_urb_state == 0bv32 && (\exists usb_mouse_probe_~tmp___9~0 : bv32 :: ~bvor64(1073741952bv32, usb_mouse_probe_~tmp___9~0) == pipe)) && ~bvadd16(\old(ldv_coherent_state), 1bv32) == ldv_coherent_state) && ~bvadd16(error, 12bv32) == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 3813]: Loop Invariant Derived loop invariant: !(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4103]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) - InvariantResult [Line: 4071]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4247]: Loop Invariant Derived loop invariant: (ldv_urb_state == 0bv32 || !(1bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4184]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == ldv_urb_state)) || \old(ldv_coherent_state) == ldv_coherent_state - InvariantResult [Line: 4100]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state))) || ((ldv_urb_state == 0bv32 && \old(ldv_coherent_state) == ldv_coherent_state) && ldv_s_usb_mouse_driver_usb_driver == 0bv32) - InvariantResult [Line: 4211]: Loop Invariant Derived loop invariant: (\old(ldv_coherent_state) == ldv_coherent_state || !(1bv32 == \old(ldv_coherent_state))) || !(0bv32 == ldv_urb_state) - InvariantResult [Line: 3813]: Loop Invariant [2018-11-18 17:16:55,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] [2018-11-18 17:16:55,433 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[usb_mouse_probe_~tmp___9~0,QUANTIFIED] Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || (((ldv_urb_state == 0bv32 && (\exists usb_mouse_probe_~tmp___9~0 : bv32 :: ~bvor64(1073741952bv32, usb_mouse_probe_~tmp___9~0) == pipe)) && \old(ldv_coherent_state) == ldv_coherent_state) && ~bvadd16(error, 12bv32) == 0bv32)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4274]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4083]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_coherent_state)) || (ldv_urb_state == 0bv32 && 0bv32 == ldv_coherent_state)) || !(0bv32 == \old(ldv_urb_state)) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: (!(1bv32 == \old(ldv_coherent_state)) || 0bv32 == ldv_coherent_state) || !(0bv32 == ldv_urb_state) - InvariantResult [Line: 4269]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 30 procedures, 229 locations, 1 error locations. SAFE Result, 18.7s OverallTime, 13 OverallIterations, 2 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2572 SDtfs, 1008 SDslu, 5740 SDs, 0 SdLazy, 734 SolverSat, 208 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 11.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1203 GetRequests, 1160 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=970occurred in iteration=10, 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.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 220 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 78 LocationsWithAnnotation, 2504 PreInvPairs, 2634 NumberOfFragments, 663 HoareAnnotationTreeSize, 2504 FomulaSimplifications, 76 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 78 FomulaSimplificationsInter, 556 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1209 NumberOfCodeBlocks, 1209 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1196 ConstructedInterpolants, 1 QuantifiedInterpolants, 197301 SizeOfPredicates, 37 NumberOfNonLiveVariables, 4621 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 76/76 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...