java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 20:37:34,209 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 20:37:34,211 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 20:37:34,221 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 20:37:34,221 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 20:37:34,222 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 20:37:34,222 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 20:37:34,223 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 20:37:34,225 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 20:37:34,225 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 20:37:34,226 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 20:37:34,226 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 20:37:34,227 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 20:37:34,228 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 20:37:34,229 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 20:37:34,231 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 20:37:34,233 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 20:37:34,234 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 20:37:34,235 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 20:37:34,236 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 20:37:34,238 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 20:37:34,238 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 20:37:34,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 20:37:34,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 20:37:34,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 20:37:34,241 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 20:37:34,241 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 20:37:34,242 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 20:37:34,242 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 20:37:34,242 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 20:37:34,242 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 20:37:34,243 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-02 20:37:34,252 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 20:37:34,253 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 20:37:34,254 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 20:37:34,254 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 20:37:34,254 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 20:37:34,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 20:37:34,255 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 20:37:34,255 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 20:37:34,255 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 20:37:34,255 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 20:37:34,255 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 20:37:34,255 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 20:37:34,256 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 20:37:34,256 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 20:37:34,256 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 20:37:34,256 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 20:37:34,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 20:37:34,256 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 20:37:34,257 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 20:37:34,257 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 20:37:34,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 20:37:34,257 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 20:37:34,257 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 20:37:34,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 20:37:34,296 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 20:37:34,299 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 20:37:34,300 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 20:37:34,300 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 20:37:34,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i [2018-02-02 20:37:34,460 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 20:37:34,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 20:37:34,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 20:37:34,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 20:37:34,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 20:37:34,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:37:34" (1/1) ... [2018-02-02 20:37:34,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75fc950d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34, skipping insertion in model container [2018-02-02 20:37:34,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:37:34" (1/1) ... [2018-02-02 20:37:34,488 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:37:34,527 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 20:37:34,625 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:37:34,643 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 20:37:34,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34 WrapperNode [2018-02-02 20:37:34,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 20:37:34,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 20:37:34,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 20:37:34,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 20:37:34,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34" (1/1) ... [2018-02-02 20:37:34,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34" (1/1) ... [2018-02-02 20:37:34,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34" (1/1) ... [2018-02-02 20:37:34,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34" (1/1) ... [2018-02-02 20:37:34,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34" (1/1) ... [2018-02-02 20:37:34,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34" (1/1) ... [2018-02-02 20:37:34,682 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34" (1/1) ... [2018-02-02 20:37:34,684 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 20:37:34,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 20:37:34,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 20:37:34,685 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 20:37:34,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/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-02-02 20:37:34,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 20:37:34,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 20:37:34,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-02-02 20:37:34,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-02-02 20:37:34,724 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-02-02 20:37:34,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-02-02 20:37:34,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-02-02 20:37:34,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-02-02 20:37:34,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-02-02 20:37:34,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-02-02 20:37:34,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials [2018-02-02 20:37:34,725 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-02-02 20:37:34,725 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe [2018-02-02 20:37:34,726 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-02-02 20:37:34,726 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-02-02 20:37:34,726 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 20:37:34,726 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 20:37:34,726 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 20:37:34,726 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 20:37:34,726 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 20:37:34,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 20:37:34,726 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 20:37:34,727 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 20:37:34,727 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-02-02 20:37:34,727 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-02-02 20:37:34,727 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 20:37:34,727 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-02-02 20:37:34,727 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 20:37:34,727 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 20:37:34,727 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-02-02 20:37:34,727 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-02-02 20:37:34,728 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-02-02 20:37:34,728 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-02-02 20:37:34,728 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-02-02 20:37:34,728 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-02-02 20:37:34,728 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-02-02 20:37:34,728 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-02-02 20:37:34,728 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials [2018-02-02 20:37:34,728 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-02-02 20:37:34,728 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe [2018-02-02 20:37:34,729 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-02-02 20:37:34,729 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-02-02 20:37:34,729 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 20:37:34,729 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 20:37:34,729 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 20:37:35,077 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 20:37:35,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:37:35 BoogieIcfgContainer [2018-02-02 20:37:35,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 20:37:35,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 20:37:35,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 20:37:35,080 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 20:37:35,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:37:34" (1/3) ... [2018-02-02 20:37:35,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66628dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:37:35, skipping insertion in model container [2018-02-02 20:37:35,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:37:34" (2/3) ... [2018-02-02 20:37:35,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66628dc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:37:35, skipping insertion in model container [2018-02-02 20:37:35,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:37:35" (3/3) ... [2018-02-02 20:37:35,082 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test15_true-valid-memsafety_true-termination.i [2018-02-02 20:37:35,088 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 20:37:35,094 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-02-02 20:37:35,118 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 20:37:35,118 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 20:37:35,118 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 20:37:35,118 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 20:37:35,118 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 20:37:35,118 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 20:37:35,118 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 20:37:35,118 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 20:37:35,119 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 20:37:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states. [2018-02-02 20:37:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 20:37:35,137 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:35,138 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:35,138 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash -26265707, now seen corresponding path program 1 times [2018-02-02 20:37:35,178 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:35,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:35,276 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:35,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 20:37:35,277 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:35,278 INFO L182 omatonBuilderFactory]: Interpolants [176#true, 177#false, 178#(= |#valid| |old(#valid)|)] [2018-02-02 20:37:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:35,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 20:37:35,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 20:37:35,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 20:37:35,357 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 3 states. [2018-02-02 20:37:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:35,593 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2018-02-02 20:37:35,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 20:37:35,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-02-02 20:37:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:35,603 INFO L225 Difference]: With dead ends: 230 [2018-02-02 20:37:35,603 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 20:37:35,604 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-02-02 20:37:35,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 20:37:35,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 174. [2018-02-02 20:37:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:37:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 190 transitions. [2018-02-02 20:37:35,639 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 190 transitions. Word has length 16 [2018-02-02 20:37:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:35,639 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 190 transitions. [2018-02-02 20:37:35,639 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 20:37:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 190 transitions. [2018-02-02 20:37:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 20:37:35,640 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:35,640 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:35,641 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:35,641 INFO L82 PathProgramCache]: Analyzing trace with hash -325108585, now seen corresponding path program 1 times [2018-02-02 20:37:35,642 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:35,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:35,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:35,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:37:35,696 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:35,696 INFO L182 omatonBuilderFactory]: Interpolants [583#true, 584#false, 585#(not (= |ldv_malloc_#t~malloc2.base| 0)), 586#(not (= |ldv_malloc_#res.base| 0)), 587#(not (= |entry_point_#t~ret24.base| 0)), 588#(not (= entry_point_~hdev~0.base 0))] [2018-02-02 20:37:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:35,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:35,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:35,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:35,698 INFO L87 Difference]: Start difference. First operand 174 states and 190 transitions. Second operand 6 states. [2018-02-02 20:37:35,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:35,747 INFO L93 Difference]: Finished difference Result 215 states and 240 transitions. [2018-02-02 20:37:35,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:37:35,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-02-02 20:37:35,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:35,749 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:37:35,749 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 20:37:35,750 INFO L554 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-02-02 20:37:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 20:37:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 170. [2018-02-02 20:37:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 20:37:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-02-02 20:37:35,760 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 18 [2018-02-02 20:37:35,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:35,760 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-02-02 20:37:35,760 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-02-02 20:37:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 20:37:35,761 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:35,761 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:35,761 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:35,761 INFO L82 PathProgramCache]: Analyzing trace with hash 743711378, now seen corresponding path program 1 times [2018-02-02 20:37:35,762 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:35,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:35,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:35,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:37:35,816 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:35,817 INFO L182 omatonBuilderFactory]: Interpolants [976#true, 977#false, 978#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 979#(and (= 0 |entry_point_#t~ret24.offset|) (= 0 |entry_point_#t~ret24.base|)), 980#(and (= 0 entry_point_~hdev~0.base) (= 0 entry_point_~hdev~0.offset))] [2018-02-02 20:37:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:35,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:37:35,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:37:35,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:37:35,818 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 5 states. [2018-02-02 20:37:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:35,837 INFO L93 Difference]: Finished difference Result 174 states and 188 transitions. [2018-02-02 20:37:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:37:35,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-02-02 20:37:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:35,838 INFO L225 Difference]: With dead ends: 174 [2018-02-02 20:37:35,838 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 20:37:35,839 INFO L554 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-02-02 20:37:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 20:37:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-02 20:37:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 20:37:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-02-02 20:37:35,847 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 21 [2018-02-02 20:37:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:35,847 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-02-02 20:37:35,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:37:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-02-02 20:37:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:37:35,848 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:35,848 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:35,848 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:35,849 INFO L82 PathProgramCache]: Analyzing trace with hash 667479760, now seen corresponding path program 1 times [2018-02-02 20:37:35,850 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:35,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:35,909 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:35,909 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:37:35,909 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:35,910 INFO L182 omatonBuilderFactory]: Interpolants [1328#false, 1329#(= 0 |ldv_malloc_#t~malloc2.offset|), 1330#(= 0 |ldv_malloc_#res.offset|), 1331#(= 0 |entry_point_#t~ret24.offset|), 1332#(= 0 entry_point_~hdev~0.offset), 1327#true] [2018-02-02 20:37:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:35,910 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:35,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:35,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:35,911 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 6 states. [2018-02-02 20:37:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:35,938 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2018-02-02 20:37:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:37:35,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-02-02 20:37:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:35,940 INFO L225 Difference]: With dead ends: 171 [2018-02-02 20:37:35,940 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 20:37:35,941 INFO L554 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-02-02 20:37:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 20:37:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-02-02 20:37:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 20:37:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2018-02-02 20:37:35,947 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 23 [2018-02-02 20:37:35,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:35,948 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2018-02-02 20:37:35,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2018-02-02 20:37:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 20:37:35,948 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:35,949 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:35,949 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:35,949 INFO L82 PathProgramCache]: Analyzing trace with hash 667479761, now seen corresponding path program 1 times [2018-02-02 20:37:35,950 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:35,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:36,003 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:36,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:37:36,003 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:36,004 INFO L182 omatonBuilderFactory]: Interpolants [1680#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 1681#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 1682#(= 1 (select |#valid| |entry_point_#t~ret24.base|)), 1683#(= 1 (select |#valid| entry_point_~hdev~0.base)), 1684#(= |#valid| |old(#valid)|), 1678#true, 1679#false] [2018-02-02 20:37:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 20:37:36,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:37:36,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:37:36,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:37:36,005 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand 7 states. [2018-02-02 20:37:36,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:36,332 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2018-02-02 20:37:36,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:37:36,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 20:37:36,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:36,334 INFO L225 Difference]: With dead ends: 216 [2018-02-02 20:37:36,334 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 20:37:36,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:37:36,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 20:37:36,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 184. [2018-02-02 20:37:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 20:37:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 211 transitions. [2018-02-02 20:37:36,342 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 211 transitions. Word has length 23 [2018-02-02 20:37:36,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:36,349 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 211 transitions. [2018-02-02 20:37:36,350 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:37:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2018-02-02 20:37:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 20:37:36,350 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:36,351 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:36,351 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash -314305773, now seen corresponding path program 1 times [2018-02-02 20:37:36,352 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:36,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:36,401 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:36,401 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:37:36,401 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:36,401 INFO L182 omatonBuilderFactory]: Interpolants [2087#true, 2088#false, 2089#(not (= |ldv_malloc_#t~malloc2.base| 0)), 2090#(not (= |ldv_malloc_#res.base| 0)), 2091#(not (= |entry_point_#t~ret25.base| 0)), 2092#(not (= entry_point_~intf~2.base 0))] [2018-02-02 20:37:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:36,402 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:36,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:36,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:36,402 INFO L87 Difference]: Start difference. First operand 184 states and 211 transitions. Second operand 6 states. [2018-02-02 20:37:36,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:36,461 INFO L93 Difference]: Finished difference Result 220 states and 251 transitions. [2018-02-02 20:37:36,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:37:36,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-02-02 20:37:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:36,464 INFO L225 Difference]: With dead ends: 220 [2018-02-02 20:37:36,464 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 20:37:36,464 INFO L554 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-02-02 20:37:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 20:37:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 184. [2018-02-02 20:37:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-02-02 20:37:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2018-02-02 20:37:36,472 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 25 [2018-02-02 20:37:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:36,472 INFO L432 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2018-02-02 20:37:36,472 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2018-02-02 20:37:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 20:37:36,473 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:36,473 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:36,473 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash -808960356, now seen corresponding path program 1 times [2018-02-02 20:37:36,474 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:36,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:36,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:36,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:37:36,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:36,584 INFO L182 omatonBuilderFactory]: Interpolants [2499#true, 2500#false, 2501#(= |#valid| |old(#valid)|), 2502#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 2503#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 2504#(and (= (select |old(#valid)| |entry_point_#t~ret24.base|) 0) (not (= |entry_point_#t~ret24.base| 0)) (= |#valid| (store |old(#valid)| |entry_point_#t~ret24.base| (select |#valid| |entry_point_#t~ret24.base|)))), 2505#(and (= (store |old(#valid)| entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (not (= entry_point_~hdev~0.base 0)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0))] [2018-02-02 20:37:36,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:36,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:37:36,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:37:36,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:37:36,584 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand 7 states. [2018-02-02 20:37:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:36,904 INFO L93 Difference]: Finished difference Result 220 states and 242 transitions. [2018-02-02 20:37:36,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:37:36,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 20:37:36,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:36,905 INFO L225 Difference]: With dead ends: 220 [2018-02-02 20:37:36,905 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 20:37:36,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:37:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 20:37:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 183. [2018-02-02 20:37:36,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 20:37:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 208 transitions. [2018-02-02 20:37:36,911 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 208 transitions. Word has length 26 [2018-02-02 20:37:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:36,912 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 208 transitions. [2018-02-02 20:37:36,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:37:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 208 transitions. [2018-02-02 20:37:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 20:37:36,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:36,912 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:36,913 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash 437179314, now seen corresponding path program 1 times [2018-02-02 20:37:36,913 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:36,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:37:36,953 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:36,954 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-02-02 20:37:36,954 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:37:36,954 INFO L182 omatonBuilderFactory]: Interpolants [2913#true, 2914#false, 2915#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 2916#(and (= 0 |entry_point_#t~ret25.base|) (= 0 |entry_point_#t~ret25.offset|)), 2917#(and (= 0 entry_point_~intf~2.base) (= entry_point_~intf~2.offset 0))] [2018-02-02 20:37:36,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:37:36,955 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:37:36,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:37:36,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:37:36,955 INFO L87 Difference]: Start difference. First operand 183 states and 208 transitions. Second operand 5 states. [2018-02-02 20:37:36,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:36,973 INFO L93 Difference]: Finished difference Result 173 states and 185 transitions. [2018-02-02 20:37:36,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:37:36,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 20:37:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:36,974 INFO L225 Difference]: With dead ends: 173 [2018-02-02 20:37:36,974 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 20:37:36,975 INFO L554 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-02-02 20:37:36,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 20:37:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-02-02 20:37:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 20:37:36,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 183 transitions. [2018-02-02 20:37:36,979 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 183 transitions. Word has length 28 [2018-02-02 20:37:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:36,979 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 183 transitions. [2018-02-02 20:37:36,980 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:37:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 183 transitions. [2018-02-02 20:37:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:37:36,980 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:36,981 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:36,981 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:36,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1753876656, now seen corresponding path program 2 times [2018-02-02 20:37:36,982 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:36,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:37,027 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:37,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-02-02 20:37:37,028 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:37,028 INFO L182 omatonBuilderFactory]: Interpolants [3264#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 3265#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 3266#(= 1 (select |#valid| |entry_point_#t~ret25.base|)), 3267#(= 1 (select |#valid| entry_point_~intf~2.base)), 3268#(= |#valid| |old(#valid)|), 3262#true, 3263#false] [2018-02-02 20:37:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:37,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:37:37,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:37:37,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:37:37,029 INFO L87 Difference]: Start difference. First operand 171 states and 183 transitions. Second operand 7 states. [2018-02-02 20:37:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:37,285 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2018-02-02 20:37:37,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:37:37,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2018-02-02 20:37:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:37,286 INFO L225 Difference]: With dead ends: 189 [2018-02-02 20:37:37,287 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 20:37:37,287 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:37:37,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 20:37:37,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-02-02 20:37:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-02-02 20:37:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2018-02-02 20:37:37,292 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 30 [2018-02-02 20:37:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:37,292 INFO L432 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2018-02-02 20:37:37,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:37:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2018-02-02 20:37:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 20:37:37,293 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:37,293 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:37,295 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1753876657, now seen corresponding path program 1 times [2018-02-02 20:37:37,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:37,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:37:37,470 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:37,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-02-02 20:37:37,470 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:37:37,471 INFO L182 omatonBuilderFactory]: Interpolants [3648#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 3649#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 3650#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 3651#(and (<= 20 (select |#length| |entry_point_#t~ret25.base|)) (= 0 |entry_point_#t~ret25.offset|)), 3652#(and (= entry_point_~intf~2.offset 0) (<= 20 (select |#length| entry_point_~intf~2.base))), 3653#(= |old(#length)| |#length|), 3646#true, 3647#false] [2018-02-02 20:37:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:37:37,471 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:37:37,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:37:37,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:37:37,472 INFO L87 Difference]: Start difference. First operand 186 states and 205 transitions. Second operand 8 states. [2018-02-02 20:37:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:37,936 INFO L93 Difference]: Finished difference Result 216 states and 240 transitions. [2018-02-02 20:37:37,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:37:37,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-02-02 20:37:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:37,937 INFO L225 Difference]: With dead ends: 216 [2018-02-02 20:37:37,937 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 20:37:37,937 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:37:37,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 20:37:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204. [2018-02-02 20:37:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 20:37:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2018-02-02 20:37:37,942 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 236 transitions. Word has length 30 [2018-02-02 20:37:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:37,942 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 236 transitions. [2018-02-02 20:37:37,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:37:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 236 transitions. [2018-02-02 20:37:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:37:37,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:37,943 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:37,943 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1756950194, now seen corresponding path program 1 times [2018-02-02 20:37:37,945 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:37,953 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:38,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:38,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-02-02 20:37:38,036 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:38,037 INFO L182 omatonBuilderFactory]: Interpolants [4081#true, 4082#false, 4083#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 4084#(= (select |#valid| |ldv_malloc_#res.base|) 1), 4085#(= 1 (select |#valid| |entry_point_#t~ret25.base|)), 4086#(= 1 (select |#valid| entry_point_~intf~2.base)), 4087#(= |#valid| |old(#valid)|), 4088#(and (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 4089#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))] [2018-02-02 20:37:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:38,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 20:37:38,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 20:37:38,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:37:38,038 INFO L87 Difference]: Start difference. First operand 204 states and 236 transitions. Second operand 9 states. [2018-02-02 20:37:38,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:38,471 INFO L93 Difference]: Finished difference Result 216 states and 252 transitions. [2018-02-02 20:37:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:37:38,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-02-02 20:37:38,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:38,473 INFO L225 Difference]: With dead ends: 216 [2018-02-02 20:37:38,473 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 20:37:38,473 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:37:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 20:37:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 210. [2018-02-02 20:37:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 20:37:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 244 transitions. [2018-02-02 20:37:38,478 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 244 transitions. Word has length 32 [2018-02-02 20:37:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:38,479 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 244 transitions. [2018-02-02 20:37:38,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 20:37:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 244 transitions. [2018-02-02 20:37:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 20:37:38,479 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:38,479 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:38,480 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1756950195, now seen corresponding path program 1 times [2018-02-02 20:37:38,480 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:38,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:37:38,666 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:38,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:37:38,666 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:37:38,666 INFO L182 omatonBuilderFactory]: Interpolants [4528#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 4529#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 4530#(and (= entry_point_~intf~2.offset 0) (<= 20 (select |#length| entry_point_~intf~2.base))), 4520#true, 4521#false, 4522#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0))), 4523#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 4524#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 4525#(and (<= 20 (select |#length| |entry_point_#t~ret25.base|)) (= (select |#valid| |entry_point_#t~ret25.base|) 1) (= 0 |entry_point_#t~ret25.offset|)), 4526#(and (= (select |#valid| entry_point_~intf~2.base) 1) (= entry_point_~intf~2.offset 0) (<= 20 (select |#length| entry_point_~intf~2.base))), 4527#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|))] [2018-02-02 20:37:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:37:38,667 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:37:38,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:37:38,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:37:38,667 INFO L87 Difference]: Start difference. First operand 210 states and 244 transitions. Second operand 11 states. [2018-02-02 20:37:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:39,134 INFO L93 Difference]: Finished difference Result 209 states and 244 transitions. [2018-02-02 20:37:39,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:37:39,135 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-02-02 20:37:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:39,135 INFO L225 Difference]: With dead ends: 209 [2018-02-02 20:37:39,135 INFO L226 Difference]: Without dead ends: 209 [2018-02-02 20:37:39,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:37:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-02-02 20:37:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 179. [2018-02-02 20:37:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 20:37:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2018-02-02 20:37:39,140 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 32 [2018-02-02 20:37:39,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:39,140 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-02-02 20:37:39,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:37:39,140 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2018-02-02 20:37:39,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-02 20:37:39,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:39,141 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 20:37:39,141 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:39,141 INFO L82 PathProgramCache]: Analyzing trace with hash 860002885, now seen corresponding path program 1 times [2018-02-02 20:37:39,142 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:39,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:39,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:39,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:37:39,279 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:39,279 INFO L182 omatonBuilderFactory]: Interpolants [4928#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 4929#(= (select |#valid| |ldv_malloc_#res.base|) 1), 4930#(= 1 (select |#valid| |entry_point_#t~ret24.base|)), 4931#(= 1 (select |#valid| entry_point_~hdev~0.base)), 4932#(= |#valid| |old(#valid)|), 4933#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 4934#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 4935#(and (not (= |entry_point_#t~ret25.base| 0)) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 4936#(and (not (= entry_point_~intf~2.base 0)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 4926#true, 4927#false] [2018-02-02 20:37:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 20:37:39,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:37:39,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:37:39,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:37:39,280 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 11 states. [2018-02-02 20:37:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:39,759 INFO L93 Difference]: Finished difference Result 193 states and 213 transitions. [2018-02-02 20:37:39,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:37:39,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-02-02 20:37:39,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:39,760 INFO L225 Difference]: With dead ends: 193 [2018-02-02 20:37:39,760 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 20:37:39,761 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:37:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 20:37:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2018-02-02 20:37:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-02-02 20:37:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 195 transitions. [2018-02-02 20:37:39,765 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 195 transitions. Word has length 35 [2018-02-02 20:37:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:39,766 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 195 transitions. [2018-02-02 20:37:39,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:37:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 195 transitions. [2018-02-02 20:37:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 20:37:39,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:39,766 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 20:37:39,767 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash 890317459, now seen corresponding path program 1 times [2018-02-02 20:37:39,768 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:39,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:37:39,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:39,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:37:39,834 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:39,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:37:39,834 INFO L182 omatonBuilderFactory]: Interpolants [5313#true, 5314#false, 5315#(and (= 0 |ldv_malloc_#res.offset|) (= 0 |ldv_malloc_#res.base|)), 5316#(and (= 0 |entry_point_#t~ret26.base|) (= 0 |entry_point_#t~ret26.offset|)), 5317#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))), 5318#(and (= |entry_point_#t~mem28.base| 0) (= |entry_point_#t~mem28.offset| (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))] [2018-02-02 20:37:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:37:39,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:37:39,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:37:39,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:37:39,835 INFO L87 Difference]: Start difference. First operand 179 states and 195 transitions. Second operand 6 states. [2018-02-02 20:37:39,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:39,894 INFO L93 Difference]: Finished difference Result 187 states and 203 transitions. [2018-02-02 20:37:39,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:37:39,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-02-02 20:37:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:39,895 INFO L225 Difference]: With dead ends: 187 [2018-02-02 20:37:39,895 INFO L226 Difference]: Without dead ends: 187 [2018-02-02 20:37:39,895 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:37:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-02-02 20:37:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2018-02-02 20:37:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-02-02 20:37:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 199 transitions. [2018-02-02 20:37:39,898 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 199 transitions. Word has length 36 [2018-02-02 20:37:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:39,898 INFO L432 AbstractCegarLoop]: Abstraction has 183 states and 199 transitions. [2018-02-02 20:37:39,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:37:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 199 transitions. [2018-02-02 20:37:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:37:39,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:39,898 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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] [2018-02-02 20:37:39,898 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash 866086568, now seen corresponding path program 1 times [2018-02-02 20:37:39,899 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:39,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:37:40,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:40,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 20:37:40,234 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:37:40,234 INFO L182 omatonBuilderFactory]: Interpolants [5696#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 5697#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (or (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (@diff |old(#valid)| |#valid|))) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 5698#(and (= (select |old(#valid)| |entry_point_#t~ret24.base|) 0) (not (= |entry_point_#t~ret24.base| 0)) (= |#valid| (store |old(#valid)| |entry_point_#t~ret24.base| (select |#valid| |entry_point_#t~ret24.base|)))), 5699#(and (= (store |old(#valid)| entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (not (= entry_point_~hdev~0.base 0)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 5700#(and (not (= |entry_point_#t~ret25.base| 0)) (not (= 0 entry_point_~hdev~0.base)) (or (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|) (and (= (select |old(#valid)| |entry_point_#t~ret25.base|) 0) (= (store (store |old(#valid)| |entry_point_#t~ret25.base| (select |#valid| |entry_point_#t~ret25.base|)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)))), 5701#(and (or (= entry_point_~intf~2.base entry_point_~hdev~0.base) (and (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (= (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|))) (not (= 0 entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base 0))), 5702#(and (not (= 0 entry_point_~hdev~0.base)) (or (and (= (select |old(#valid)| entry_point_~hdev~0.base) (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (= (select |old(#valid)| (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0))) (select (store |#valid| entry_point_~hdev~0.base 0) (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0))))) (= 0 (select |#valid| entry_point_~hdev~0.base)))), 5693#true, 5694#false, 5695#(= |#valid| |old(#valid)|)] [2018-02-02 20:37:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-02-02 20:37:40,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:37:40,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:37:40,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:37:40,235 INFO L87 Difference]: Start difference. First operand 183 states and 199 transitions. Second operand 10 states. [2018-02-02 20:37:40,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:40,884 INFO L93 Difference]: Finished difference Result 195 states and 211 transitions. [2018-02-02 20:37:40,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:37:40,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-02 20:37:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:40,885 INFO L225 Difference]: With dead ends: 195 [2018-02-02 20:37:40,885 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 20:37:40,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:37:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 20:37:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 177. [2018-02-02 20:37:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 20:37:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 192 transitions. [2018-02-02 20:37:40,890 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 192 transitions. Word has length 38 [2018-02-02 20:37:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:40,890 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 192 transitions. [2018-02-02 20:37:40,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:37:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 192 transitions. [2018-02-02 20:37:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:37:40,891 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:40,891 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:40,891 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:40,891 INFO L82 PathProgramCache]: Analyzing trace with hash 499648277, now seen corresponding path program 1 times [2018-02-02 20:37:40,892 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:40,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:40,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:40,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:37:40,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:40,953 INFO L182 omatonBuilderFactory]: Interpolants [6081#true, 6082#false, 6083#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 6084#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 6085#(= 1 (select |#valid| |entry_point_#t~ret26.base|)), 6086#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))), 6087#(= 1 (select |#valid| |entry_point_#t~mem29.base|))] [2018-02-02 20:37:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:40,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:37:40,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:37:40,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:37:40,954 INFO L87 Difference]: Start difference. First operand 177 states and 192 transitions. Second operand 7 states. [2018-02-02 20:37:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:41,115 INFO L93 Difference]: Finished difference Result 176 states and 191 transitions. [2018-02-02 20:37:41,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:37:41,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-02-02 20:37:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:41,116 INFO L225 Difference]: With dead ends: 176 [2018-02-02 20:37:41,116 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 20:37:41,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:37:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 20:37:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-02-02 20:37:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 20:37:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 191 transitions. [2018-02-02 20:37:41,119 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 191 transitions. Word has length 38 [2018-02-02 20:37:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:41,119 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 191 transitions. [2018-02-02 20:37:41,119 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:37:41,119 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 191 transitions. [2018-02-02 20:37:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 20:37:41,120 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:41,120 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:37:41,120 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:41,120 INFO L82 PathProgramCache]: Analyzing trace with hash 499648278, now seen corresponding path program 1 times [2018-02-02 20:37:41,121 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:41,127 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:37:41,239 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:41,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:37:41,240 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:37:41,240 INFO L182 omatonBuilderFactory]: Interpolants [6448#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6449#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (<= (+ |ldv_malloc_#in~size| 1) 0) (<= 2147483648 |ldv_malloc_#in~size|))), 6450#(and (= 0 |ldv_malloc_#res.offset|) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 2147483648 |ldv_malloc_#in~size|))), 6451#(and (<= 9 (select |#length| |entry_point_#t~ret26.base|)) (= 0 |entry_point_#t~ret26.offset|)), 6452#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))), 6453#(and (= |entry_point_#t~mem29.offset| 0) (<= 9 (select |#length| |entry_point_#t~mem29.base|))), 6446#true, 6447#false] [2018-02-02 20:37:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:37:41,240 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:37:41,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:37:41,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:37:41,241 INFO L87 Difference]: Start difference. First operand 176 states and 191 transitions. Second operand 8 states. [2018-02-02 20:37:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:41,525 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2018-02-02 20:37:41,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 20:37:41,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-02-02 20:37:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:41,526 INFO L225 Difference]: With dead ends: 177 [2018-02-02 20:37:41,526 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 20:37:41,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:37:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 20:37:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-02-02 20:37:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 20:37:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 190 transitions. [2018-02-02 20:37:41,531 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 190 transitions. Word has length 38 [2018-02-02 20:37:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:41,531 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 190 transitions. [2018-02-02 20:37:41,531 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:37:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 190 transitions. [2018-02-02 20:37:41,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:37:41,532 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:41,532 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 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-02-02 20:37:41,532 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash -874341065, now seen corresponding path program 1 times [2018-02-02 20:37:41,533 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:41,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:41,912 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:41,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:37:41,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:41,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:41,912 INFO L182 omatonBuilderFactory]: Interpolants [6816#(and (or (< 0 (div ldv_malloc_~size 4294967296)) (and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (<= |ldv_malloc_#in~size| ldv_malloc_~size))) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 6817#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|) (or (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (and (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (<= 2147483648 |ldv_malloc_#in~size|)) (<= 4294967296 |ldv_malloc_#in~size|))), 6818#(and (= 0 |ldv_malloc_#res.offset|) (or (and (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0) (<= 2147483648 |ldv_malloc_#in~size|)) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)) (<= 4294967296 |ldv_malloc_#in~size|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 6819#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|) (<= 12 (select |#length| |entry_point_#t~ret24.base|))), 6820#(and (<= 12 (select |#length| entry_point_~hdev~0.base)) (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 6821#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 6822#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 6823#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|)))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 6824#(and (= |#length| (store |old(#length)| |ldv_malloc_#t~malloc2.base| (select |#length| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 6825#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 6826#(and (<= 12 (select |#length| entry_point_~hdev~0.base)) (= entry_point_~hdev~0.offset 0)), 6814#true, 6815#false] [2018-02-02 20:37:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:41,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:37:41,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:37:41,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:37:41,916 INFO L87 Difference]: Start difference. First operand 175 states and 190 transitions. Second operand 13 states. [2018-02-02 20:37:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:42,705 INFO L93 Difference]: Finished difference Result 184 states and 200 transitions. [2018-02-02 20:37:42,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:37:42,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-02-02 20:37:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:42,706 INFO L225 Difference]: With dead ends: 184 [2018-02-02 20:37:42,706 INFO L226 Difference]: Without dead ends: 184 [2018-02-02 20:37:42,706 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:37:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-02-02 20:37:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 174. [2018-02-02 20:37:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:37:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 189 transitions. [2018-02-02 20:37:42,708 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 189 transitions. Word has length 40 [2018-02-02 20:37:42,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:42,708 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 189 transitions. [2018-02-02 20:37:42,709 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:37:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 189 transitions. [2018-02-02 20:37:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 20:37:42,709 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:42,709 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 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-02-02 20:37:42,710 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash -904842582, now seen corresponding path program 1 times [2018-02-02 20:37:42,711 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:42,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:42,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:42,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:37:42,770 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:42,771 INFO L182 omatonBuilderFactory]: Interpolants [7200#(not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)), 7201#(not (= |entry_point_#t~mem28.base| 0)), 7195#true, 7196#false, 7197#(not (= |ldv_malloc_#t~malloc2.base| 0)), 7198#(not (= |ldv_malloc_#res.base| 0)), 7199#(not (= |entry_point_#t~ret26.base| 0))] [2018-02-02 20:37:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:42,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:37:42,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:37:42,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:37:42,772 INFO L87 Difference]: Start difference. First operand 174 states and 189 transitions. Second operand 7 states. [2018-02-02 20:37:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:42,838 INFO L93 Difference]: Finished difference Result 172 states and 186 transitions. [2018-02-02 20:37:42,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:37:42,838 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-02-02 20:37:42,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:42,839 INFO L225 Difference]: With dead ends: 172 [2018-02-02 20:37:42,839 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 20:37:42,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:37:42,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 20:37:42,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-02-02 20:37:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-02-02 20:37:42,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 186 transitions. [2018-02-02 20:37:42,843 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 186 transitions. Word has length 40 [2018-02-02 20:37:42,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:42,844 INFO L432 AbstractCegarLoop]: Abstraction has 172 states and 186 transitions. [2018-02-02 20:37:42,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:37:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 186 transitions. [2018-02-02 20:37:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:37:42,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:42,844 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:42,844 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1596182576, now seen corresponding path program 1 times [2018-02-02 20:37:42,845 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:42,856 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:42,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:42,910 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:42,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:37:42,910 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:42,911 INFO L182 omatonBuilderFactory]: Interpolants [7552#true, 7553#false, 7554#(= 1 (select |#valid| entry_point_~hdev~0.base)), 7555#(= 1 (select |#valid| |ldv_arvo_probe_#in~hdev.base|)), 7556#(= 1 (select |#valid| ldv_arvo_probe_~hdev.base)), 7557#(= 1 (select |#valid| |ldv_arvo_init_specials_#in~hdev.base|)), 7558#(= 1 (select |#valid| ldv_arvo_init_specials_~hdev.base))] [2018-02-02 20:37:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:42,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:37:42,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:37:42,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:37:42,912 INFO L87 Difference]: Start difference. First operand 172 states and 186 transitions. Second operand 7 states. [2018-02-02 20:37:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,138 INFO L93 Difference]: Finished difference Result 178 states and 193 transitions. [2018-02-02 20:37:43,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:37:43,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-02-02 20:37:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,140 INFO L225 Difference]: With dead ends: 178 [2018-02-02 20:37:43,140 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 20:37:43,140 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:37:43,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 20:37:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 171. [2018-02-02 20:37:43,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-02-02 20:37:43,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2018-02-02 20:37:43,144 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 45 [2018-02-02 20:37:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,144 INFO L432 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2018-02-02 20:37:43,144 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:37:43,144 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2018-02-02 20:37:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 20:37:43,145 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,145 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:43,145 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:43,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1596182575, now seen corresponding path program 1 times [2018-02-02 20:37:43,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:43,255 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:43,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 20:37:43,255 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:43,255 INFO L182 omatonBuilderFactory]: Interpolants [7920#(and (<= 12 (select |#length| ldv_arvo_probe_~hdev.base)) (= 0 ldv_arvo_probe_~hdev.offset)), 7921#(and (<= 12 (select |#length| |ldv_arvo_init_specials_#in~hdev.base|)) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 7922#(and (= ldv_arvo_init_specials_~hdev.offset 0) (<= 12 (select |#length| ldv_arvo_init_specials_~hdev.base))), 7912#true, 7913#false, 7914#(= 0 |ldv_malloc_#t~malloc2.offset|), 7915#(= 0 |ldv_malloc_#res.offset|), 7916#(= 0 |entry_point_#t~ret24.offset|), 7917#(= 0 entry_point_~hdev~0.offset), 7918#(and (<= (+ entry_point_~hdev~0.offset 12) (select |#length| entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 7919#(and (<= 12 (select |#length| |ldv_arvo_probe_#in~hdev.base|)) (= 0 |ldv_arvo_probe_#in~hdev.offset|))] [2018-02-02 20:37:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:43,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:37:43,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:37:43,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:37:43,256 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand 11 states. [2018-02-02 20:37:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,450 INFO L93 Difference]: Finished difference Result 177 states and 192 transitions. [2018-02-02 20:37:43,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:37:43,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-02-02 20:37:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,451 INFO L225 Difference]: With dead ends: 177 [2018-02-02 20:37:43,451 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 20:37:43,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:37:43,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 20:37:43,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2018-02-02 20:37:43,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 20:37:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2018-02-02 20:37:43,454 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 45 [2018-02-02 20:37:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,455 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2018-02-02 20:37:43,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:37:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2018-02-02 20:37:43,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:37:43,455 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,455 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:43,455 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:43,455 INFO L82 PathProgramCache]: Analyzing trace with hash -628127471, now seen corresponding path program 1 times [2018-02-02 20:37:43,456 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:43,600 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:43,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:43,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:37:43,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:43,601 INFO L182 omatonBuilderFactory]: Interpolants [8288#(= 1 (select |#valid| |ldv_arvo_init_specials_#t~mem14.base|)), 8289#(= 1 (select |#valid| ldv_arvo_init_specials_~intf~0.base)), 8276#true, 8277#false, 8278#(= 0 |ldv_malloc_#t~malloc2.offset|), 8279#(= 0 |ldv_malloc_#res.offset|), 8280#(= 0 |entry_point_#t~ret24.offset|), 8281#(= 0 entry_point_~hdev~0.offset), 8282#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (= 0 entry_point_~hdev~0.offset)), 8283#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)))) (= 0 entry_point_~hdev~0.offset)), 8284#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)))) (= 0 |ldv_arvo_probe_#in~hdev.offset|)), 8285#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8)))) (= 0 ldv_arvo_probe_~hdev.offset)), 8286#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)))) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 8287#(and (= ldv_arvo_init_specials_~hdev.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)))))] [2018-02-02 20:37:43,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:43,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:37:43,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:37:43,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:37:43,602 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 14 states. [2018-02-02 20:37:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:43,943 INFO L93 Difference]: Finished difference Result 171 states and 185 transitions. [2018-02-02 20:37:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:37:43,946 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-02-02 20:37:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:43,947 INFO L225 Difference]: With dead ends: 171 [2018-02-02 20:37:43,947 INFO L226 Difference]: Without dead ends: 171 [2018-02-02 20:37:43,947 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:37:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-02-02 20:37:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-02-02 20:37:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-02-02 20:37:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 183 transitions. [2018-02-02 20:37:43,951 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 183 transitions. Word has length 47 [2018-02-02 20:37:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:43,952 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 183 transitions. [2018-02-02 20:37:43,952 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:37:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2018-02-02 20:37:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 20:37:43,952 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:43,952 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:43,952 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:43,953 INFO L82 PathProgramCache]: Analyzing trace with hash -628127470, now seen corresponding path program 1 times [2018-02-02 20:37:43,954 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:43,970 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:37:44,239 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:44,239 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-02-02 20:37:44,239 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:37:44,239 INFO L182 omatonBuilderFactory]: Interpolants [8642#true, 8643#false, 8644#(= 0 |ldv_malloc_#t~malloc2.offset|), 8645#(= 0 |ldv_malloc_#res.offset|), 8646#(= 0 |entry_point_#t~ret24.offset|), 8647#(= 0 entry_point_~hdev~0.offset), 8648#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 8649#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 8650#(or (<= (+ |ldv_malloc_#in~size| 1) 0) (= 0 |ldv_malloc_#res.offset|) (<= 4294967296 |ldv_malloc_#in~size|)), 8651#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 8652#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 8653#(and (<= (+ entry_point_~intf~2.offset 8) (select |#length| entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 8654#(and (<= 8 (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (= 0 entry_point_~hdev~0.offset) (<= (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))))), 8655#(and (<= (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)))) (= 0 |ldv_arvo_probe_#in~hdev.offset|) (<= 8 (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)))), 8656#(and (<= 8 (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8)))) (= 0 ldv_arvo_probe_~hdev.offset)), 8657#(and (= 0 |ldv_arvo_init_specials_#in~hdev.offset|) (<= 8 (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))) (<= (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))))), 8658#(and (<= 8 (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (= ldv_arvo_init_specials_~hdev.offset 0) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (select |#length| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))))), 8659#(and (<= 8 |ldv_arvo_init_specials_#t~mem14.offset|) (<= |ldv_arvo_init_specials_#t~mem14.offset| (select |#length| |ldv_arvo_init_specials_#t~mem14.base|))), 8660#(and (<= (+ ldv_arvo_init_specials_~intf~0.offset 8) (select |#length| ldv_arvo_init_specials_~intf~0.base)) (<= 0 ldv_arvo_init_specials_~intf~0.offset))] [2018-02-02 20:37:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 20:37:44,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-02-02 20:37:44,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-02-02 20:37:44,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:37:44,240 INFO L87 Difference]: Start difference. First operand 169 states and 183 transitions. Second operand 19 states. [2018-02-02 20:37:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:44,585 INFO L93 Difference]: Finished difference Result 170 states and 184 transitions. [2018-02-02 20:37:44,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 20:37:44,585 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-02-02 20:37:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:44,586 INFO L225 Difference]: With dead ends: 170 [2018-02-02 20:37:44,586 INFO L226 Difference]: Without dead ends: 170 [2018-02-02 20:37:44,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:37:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-02-02 20:37:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-02-02 20:37:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-02-02 20:37:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-02-02 20:37:44,589 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 47 [2018-02-02 20:37:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:44,590 INFO L432 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-02-02 20:37:44,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-02-02 20:37:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-02-02 20:37:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:37:44,590 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:44,590 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:44,591 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:44,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2002884989, now seen corresponding path program 1 times [2018-02-02 20:37:44,592 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:44,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:45,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:37:45,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:45,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-02-02 20:37:45,030 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:37:45,030 INFO L182 omatonBuilderFactory]: Interpolants [9024#(and (= 1 (select |#valid| |entry_point_#t~ret26.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 9025#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset)), 9026#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset)), 9027#(and (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 9028#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)))) (= 0 entry_point_~hdev~0.offset)), 9029#(and (= 0 |ldv_arvo_probe_#in~hdev.offset|) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)) (- 8)) 4))))), 9030#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8)) (- 8)) 4)))) (= 0 ldv_arvo_probe_~hdev.offset)), 9031#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)) (- 8)) 4)))) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 9032#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (- 8)) 4)))) (= ldv_arvo_init_specials_~hdev.offset 0)), 9033#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#t~mem14.base|) (+ (+ |ldv_arvo_init_specials_#t~mem14.offset| (- 8)) 4)))), 9034#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~intf~0.base) (+ ldv_arvo_init_specials_~intf~0.offset 4)))), 9035#(= 1 (select |#valid| |ldv_arvo_init_specials_#t~mem15.base|)), 9013#true, 9014#false, 9015#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 9016#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9017#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|)), 9018#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 9019#(= |#valid| |old(#valid)|), 9020#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 9021#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9022#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 entry_point_~hdev~0.offset)), 9023#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset))] [2018-02-02 20:37:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:37:45,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 20:37:45,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 20:37:45,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-02-02 20:37:45,031 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 23 states. [2018-02-02 20:37:46,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:46,164 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2018-02-02 20:37:46,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-02 20:37:46,165 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-02-02 20:37:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:46,165 INFO L225 Difference]: With dead ends: 181 [2018-02-02 20:37:46,165 INFO L226 Difference]: Without dead ends: 181 [2018-02-02 20:37:46,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2018-02-02 20:37:46,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-02-02 20:37:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 167. [2018-02-02 20:37:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-02-02 20:37:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 181 transitions. [2018-02-02 20:37:46,169 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 181 transitions. Word has length 48 [2018-02-02 20:37:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:46,169 INFO L432 AbstractCegarLoop]: Abstraction has 167 states and 181 transitions. [2018-02-02 20:37:46,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 20:37:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 181 transitions. [2018-02-02 20:37:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 20:37:46,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:46,169 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:46,169 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:46,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2002884990, now seen corresponding path program 1 times [2018-02-02 20:37:46,172 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:46,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:37:46,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:46,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 20:37:46,859 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:37:46,860 INFO L182 omatonBuilderFactory]: Interpolants [9412#true, 9413#false, 9414#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 9415#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9416#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|)), 9417#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 9418#(= |#valid| |old(#valid)|), 9419#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 9420#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 9421#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 entry_point_~hdev~0.offset)), 9422#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 9423#(and (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0)) (or (< 0 (div ldv_malloc_~size 4294967296)) (and (= |#valid| |old(#valid)|) (<= |ldv_malloc_#in~size| ldv_malloc_~size)))), 9424#(or (<= 4294967296 |ldv_malloc_#in~size|) (and (or (and (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#t~malloc2.base|)) (= 0 |ldv_malloc_#t~malloc2.offset|)) (and (<= (+ (select |#length| |ldv_malloc_#t~malloc2.base|) 1) 0) (= 0 |ldv_malloc_#t~malloc2.offset|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)))), 9425#(or (and (or (and (= 0 |ldv_malloc_#res.offset|) (<= (+ (select |#length| |ldv_malloc_#res.base|) 1) 0)) (and (= 0 |ldv_malloc_#res.offset|) (<= |ldv_malloc_#in~size| (select |#length| |ldv_malloc_#res.base|)))) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))) (<= 4294967296 |ldv_malloc_#in~size|)), 9426#(and (or (and (<= (+ (select |#length| |entry_point_#t~ret26.base|) 1) 0) (= 0 |entry_point_#t~ret26.offset|)) (and (<= 9 (select |#length| |entry_point_#t~ret26.base|)) (= 0 |entry_point_#t~ret26.offset|))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 9427#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (or (and (<= (+ (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 1) 0) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 9428#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (or (and (= |entry_point_#t~mem29.base| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (<= 9 (select |#length| |entry_point_#t~mem29.base|))) (and (= |entry_point_#t~mem29.offset| 0) (<= (+ (select |#length| |entry_point_#t~mem29.base|) 1) 0)))), 9429#(and (= 0 (select (select (store |#memory_$Pointer$.offset| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) (+ entry_point_~intf~2.offset 8))) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (<= 9 (select |#length| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 9430#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4))) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)))) (= 0 entry_point_~hdev~0.offset)), 9431#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)) (- 8)) 4))) (= 0 |ldv_arvo_probe_#in~hdev.offset|) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ 0 8)) (- 8)) 4))))), 9432#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8)) (- 8)) 4)))) (= 0 ldv_arvo_probe_~hdev.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_probe_~hdev.base) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_probe_~hdev.base) (+ 0 8)) (- 8)) 4)))), 9433#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)) (- 8)) 4)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ 0 8)) (- 8)) 4))) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 9434#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (- 8)) 4)))) (= ldv_arvo_init_specials_~hdev.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (- 8)) 4)))), 9435#(and (= 0 (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#t~mem14.base|) (+ (+ |ldv_arvo_init_specials_#t~mem14.offset| (- 8)) 4))) (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#t~mem14.base|) (+ (+ |ldv_arvo_init_specials_#t~mem14.offset| (- 8)) 4))))), 9436#(and (<= 9 (select |#length| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~intf~0.base) (+ ldv_arvo_init_specials_~intf~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~intf~0.base) (+ ldv_arvo_init_specials_~intf~0.offset 4)))), 9437#(and (<= 9 (select |#length| |ldv_arvo_init_specials_#t~mem15.base|)) (= |ldv_arvo_init_specials_#t~mem15.offset| 0))] [2018-02-02 20:37:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 20:37:46,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 20:37:46,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 20:37:46,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:37:46,860 INFO L87 Difference]: Start difference. First operand 167 states and 181 transitions. Second operand 26 states. [2018-02-02 20:37:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:48,418 INFO L93 Difference]: Finished difference Result 180 states and 198 transitions. [2018-02-02 20:37:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:37:48,418 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-02-02 20:37:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:48,419 INFO L225 Difference]: With dead ends: 180 [2018-02-02 20:37:48,419 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 20:37:48,419 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=158, Invalid=1648, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:37:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 20:37:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2018-02-02 20:37:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 20:37:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 180 transitions. [2018-02-02 20:37:48,422 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 180 transitions. Word has length 48 [2018-02-02 20:37:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:48,422 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 180 transitions. [2018-02-02 20:37:48,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 20:37:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2018-02-02 20:37:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:37:48,423 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:48,423 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:48,423 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash -411236025, now seen corresponding path program 1 times [2018-02-02 20:37:48,424 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:48,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:48,580 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:48,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 20:37:48,580 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:48,580 INFO L182 omatonBuilderFactory]: Interpolants [9824#(= 1 (select |#valid| ldv_arvo_init_specials_~hdev.base)), 9825#(= 1 (select |#valid| |ldv_hid_set_drvdata_#in~hdev.base|)), 9826#(= 1 (select |#valid| ldv_hid_set_drvdata_~hdev.base)), 9827#(= 1 (select |#valid| |ldv_dev_set_drvdata_#in~dev.base|)), 9828#(= 1 (select |#valid| ldv_dev_set_drvdata_~dev.base)), 9818#true, 9819#false, 9820#(= 1 (select |#valid| entry_point_~hdev~0.base)), 9821#(= 1 (select |#valid| |ldv_arvo_probe_#in~hdev.base|)), 9822#(= 1 (select |#valid| ldv_arvo_probe_~hdev.base)), 9823#(= 1 (select |#valid| |ldv_arvo_init_specials_#in~hdev.base|))] [2018-02-02 20:37:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:48,580 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:37:48,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:37:48,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:37:48,581 INFO L87 Difference]: Start difference. First operand 166 states and 180 transitions. Second operand 11 states. [2018-02-02 20:37:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:48,824 INFO L93 Difference]: Finished difference Result 182 states and 196 transitions. [2018-02-02 20:37:48,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:37:48,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2018-02-02 20:37:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:48,824 INFO L225 Difference]: With dead ends: 182 [2018-02-02 20:37:48,824 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 20:37:48,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:37:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 20:37:48,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2018-02-02 20:37:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:37:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 188 transitions. [2018-02-02 20:37:48,827 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 188 transitions. Word has length 54 [2018-02-02 20:37:48,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:48,827 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 188 transitions. [2018-02-02 20:37:48,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:37:48,827 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 188 transitions. [2018-02-02 20:37:48,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-02-02 20:37:48,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:48,828 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:48,828 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:48,828 INFO L82 PathProgramCache]: Analyzing trace with hash -411236024, now seen corresponding path program 1 times [2018-02-02 20:37:48,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:48,838 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:48,966 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:48,967 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:37:48,967 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:48,967 INFO L182 omatonBuilderFactory]: Interpolants [10193#true, 10194#false, 10195#(= 0 |ldv_malloc_#t~malloc2.offset|), 10196#(= 0 |ldv_malloc_#res.offset|), 10197#(= 0 |entry_point_#t~ret24.offset|), 10198#(= 0 entry_point_~hdev~0.offset), 10199#(= 0 |ldv_arvo_probe_#in~hdev.offset|), 10200#(= 0 ldv_arvo_probe_~hdev.offset), 10201#(= 0 |ldv_arvo_init_specials_#in~hdev.offset|), 10202#(= ldv_arvo_init_specials_~hdev.offset 0), 10203#(and (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (= ldv_arvo_init_specials_~hdev.offset 0)), 10204#(and (= 0 |ldv_hid_set_drvdata_#in~hdev.offset|) (<= 12 (select |#length| |ldv_hid_set_drvdata_#in~hdev.base|))), 10205#(and (= 0 ldv_hid_set_drvdata_~hdev.offset) (<= 12 (select |#length| ldv_hid_set_drvdata_~hdev.base))), 10206#(and (= 0 |ldv_dev_set_drvdata_#in~dev.offset|) (<= 12 (select |#length| |ldv_dev_set_drvdata_#in~dev.base|))), 10207#(and (= ldv_dev_set_drvdata_~dev.offset 0) (<= 12 (select |#length| ldv_dev_set_drvdata_~dev.base)))] [2018-02-02 20:37:48,967 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:48,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:37:48,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:37:48,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:37:48,968 INFO L87 Difference]: Start difference. First operand 174 states and 188 transitions. Second operand 15 states. [2018-02-02 20:37:49,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:49,136 INFO L93 Difference]: Finished difference Result 176 states and 189 transitions. [2018-02-02 20:37:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:37:49,136 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-02-02 20:37:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:49,137 INFO L225 Difference]: With dead ends: 176 [2018-02-02 20:37:49,137 INFO L226 Difference]: Without dead ends: 176 [2018-02-02 20:37:49,137 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2018-02-02 20:37:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-02-02 20:37:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-02-02 20:37:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:37:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-02 20:37:49,140 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 54 [2018-02-02 20:37:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:49,140 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-02 20:37:49,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:37:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-02 20:37:49,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:37:49,141 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:49,141 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:49,141 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:49,141 INFO L82 PathProgramCache]: Analyzing trace with hash -473136990, now seen corresponding path program 1 times [2018-02-02 20:37:49,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:49,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:49,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:49,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:37:49,201 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,202 INFO L182 omatonBuilderFactory]: Interpolants [10576#(= 1 (select |#valid| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|)), 10577#(= 1 (select |#valid| ldv_arvo_init_arvo_device_struct_~arvo.base)), 10570#true, 10571#false, 10572#(= 1 (select |#valid| |ldv_zalloc_#t~malloc3.base|)), 10573#(= 1 (select |#valid| |ldv_zalloc_#res.base|)), 10574#(= 1 (select |#valid| |ldv_arvo_init_specials_#t~ret17.base|)), 10575#(= 1 (select |#valid| ldv_arvo_init_specials_~arvo~0.base))] [2018-02-02 20:37:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,202 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:37:49,202 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:37:49,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:37:49,203 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 8 states. [2018-02-02 20:37:49,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:49,369 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2018-02-02 20:37:49,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 20:37:49,369 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-02-02 20:37:49,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:49,370 INFO L225 Difference]: With dead ends: 172 [2018-02-02 20:37:49,370 INFO L226 Difference]: Without dead ends: 172 [2018-02-02 20:37:49,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:37:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-02-02 20:37:49,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-02-02 20:37:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-02-02 20:37:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 183 transitions. [2018-02-02 20:37:49,374 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 183 transitions. Word has length 65 [2018-02-02 20:37:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:49,374 INFO L432 AbstractCegarLoop]: Abstraction has 170 states and 183 transitions. [2018-02-02 20:37:49,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:37:49,374 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 183 transitions. [2018-02-02 20:37:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 20:37:49,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:49,375 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:49,375 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash -473136989, now seen corresponding path program 1 times [2018-02-02 20:37:49,376 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:49,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:49,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:37:49,601 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,602 INFO L182 omatonBuilderFactory]: Interpolants [10928#(and (= 0 |ldv_zalloc_#t~malloc3.offset|) (or (<= |ldv_zalloc_#in~size| (select |#length| |ldv_zalloc_#t~malloc3.base|)) (<= 2147483648 |ldv_zalloc_#in~size|) (<= (+ |ldv_zalloc_#in~size| 1) 0))), 10929#(and (= 0 |ldv_zalloc_#res.offset|) (or (<= 2147483648 |ldv_zalloc_#in~size|) (<= (+ |ldv_zalloc_#in~size| 1) 0) (<= |ldv_zalloc_#in~size| (select |#length| |ldv_zalloc_#res.base|)))), 10930#(and (<= 12 (select |#length| |ldv_arvo_init_specials_#t~ret17.base|)) (= 0 |ldv_arvo_init_specials_#t~ret17.offset|)), 10931#(and (<= 12 (select |#length| ldv_arvo_init_specials_~arvo~0.base)) (= 0 ldv_arvo_init_specials_~arvo~0.offset)), 10932#(and (= 0 |ldv_arvo_init_arvo_device_struct_#in~arvo.offset|) (<= 12 (select |#length| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|))), 10933#(and (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0) (<= 12 (select |#length| ldv_arvo_init_arvo_device_struct_~arvo.base))), 10924#true, 10925#false, 10926#(and (or (<= |ldv_zalloc_#in~size| ldv_zalloc_~size) (< 0 (div ldv_zalloc_~size 4294967296))) (or (<= ldv_zalloc_~size |ldv_zalloc_#in~size|) (<= (+ (div ldv_zalloc_~size 4294967296) 1) 0))), 10927#(and (or (<= (div ldv_zalloc_~size 4294967296) 0) (<= (* 4294967296 (div ldv_zalloc_~size 4294967296)) |ldv_zalloc_#in~size|)) (or (<= (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483648) |ldv_zalloc_#in~size|) (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (<= (+ (div ldv_zalloc_~size 4294967296) 1) 0)) (= 0 |ldv_zalloc_#t~malloc3.offset|) (or (and (<= |ldv_zalloc_#in~size| ldv_zalloc_~size) (or (and (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|) 4294967296)) (< (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647) ldv_zalloc_~size)) (and (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|)))))) (< 0 (div ldv_zalloc_~size 4294967296))))] [2018-02-02 20:37:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:37:49,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:37:49,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:37:49,602 INFO L87 Difference]: Start difference. First operand 170 states and 183 transitions. Second operand 10 states. [2018-02-02 20:37:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:49,824 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2018-02-02 20:37:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:37:49,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2018-02-02 20:37:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:49,825 INFO L225 Difference]: With dead ends: 168 [2018-02-02 20:37:49,825 INFO L226 Difference]: Without dead ends: 168 [2018-02-02 20:37:49,826 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:37:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-02-02 20:37:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-02-02 20:37:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 20:37:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 179 transitions. [2018-02-02 20:37:49,828 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 179 transitions. Word has length 65 [2018-02-02 20:37:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:49,828 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 179 transitions. [2018-02-02 20:37:49,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:37:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 179 transitions. [2018-02-02 20:37:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-02-02 20:37:49,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:49,828 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:49,828 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:49,828 INFO L82 PathProgramCache]: Analyzing trace with hash -288623325, now seen corresponding path program 1 times [2018-02-02 20:37:49,829 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:49,837 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,864 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:49,864 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 20:37:49,864 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,864 INFO L182 omatonBuilderFactory]: Interpolants [11274#true, 11275#false, 11276#(= 0 |ldv_arvo_probe_#res|), 11277#(= |entry_point_#t~ret33| 0)] [2018-02-02 20:37:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,865 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 20:37:49,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 20:37:49,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:37:49,865 INFO L87 Difference]: Start difference. First operand 166 states and 179 transitions. Second operand 4 states. [2018-02-02 20:37:49,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:49,871 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-02-02 20:37:49,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 20:37:49,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2018-02-02 20:37:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:49,872 INFO L225 Difference]: With dead ends: 174 [2018-02-02 20:37:49,872 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 20:37:49,873 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 20:37:49,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 20:37:49,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-02 20:37:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 20:37:49,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-02 20:37:49,876 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 69 [2018-02-02 20:37:49,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:49,876 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-02 20:37:49,876 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 20:37:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-02 20:37:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 20:37:49,876 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:49,877 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:49,877 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:49,877 INFO L82 PathProgramCache]: Analyzing trace with hash -804539978, now seen corresponding path program 1 times [2018-02-02 20:37:49,877 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:49,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:49,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 20:37:49,912 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,913 INFO L182 omatonBuilderFactory]: Interpolants [11626#true, 11627#false, 11628#(= 0 |ldv_arvo_init_specials_#res|), 11629#(= 0 |ldv_arvo_probe_#t~ret23|), 11630#(= ldv_arvo_probe_~retval~1 0)] [2018-02-02 20:37:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 20:37:49,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 20:37:49,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 20:37:49,913 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 5 states. [2018-02-02 20:37:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:49,923 INFO L93 Difference]: Finished difference Result 178 states and 191 transitions. [2018-02-02 20:37:49,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 20:37:49,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-02-02 20:37:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:49,924 INFO L225 Difference]: With dead ends: 178 [2018-02-02 20:37:49,924 INFO L226 Difference]: Without dead ends: 178 [2018-02-02 20:37:49,925 INFO L554 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-02-02 20:37:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-02-02 20:37:49,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-02-02 20:37:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 20:37:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-02-02 20:37:49,928 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 70 [2018-02-02 20:37:49,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:49,928 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-02-02 20:37:49,928 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 20:37:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-02-02 20:37:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:37:49,929 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:49,929 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:49,929 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash 172589229, now seen corresponding path program 1 times [2018-02-02 20:37:49,930 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:49,939 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:37:49,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:37:49,988 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,989 INFO L182 omatonBuilderFactory]: Interpolants [11987#true, 11988#false, 11989#(= 1 (select |#valid| entry_point_~hdev~0.base)), 11990#(= |#valid| |old(#valid)|), 11991#(= 1 (select |#valid| |ldv_arvo_remove_#in~hdev.base|)), 11992#(= 1 (select |#valid| ldv_arvo_remove_~hdev.base)), 11993#(= 1 (select |#valid| |lvd_arvo_remove_specials_#in~hdev.base|)), 11994#(= 1 (select |#valid| lvd_arvo_remove_specials_~hdev.base))] [2018-02-02 20:37:49,989 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:37:49,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:37:49,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:37:49,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:37:49,989 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 8 states. [2018-02-02 20:37:50,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:50,289 INFO L93 Difference]: Finished difference Result 213 states and 230 transitions. [2018-02-02 20:37:50,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:37:50,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-02-02 20:37:50,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:50,290 INFO L225 Difference]: With dead ends: 213 [2018-02-02 20:37:50,290 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 20:37:50,290 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:37:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 20:37:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 199. [2018-02-02 20:37:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-02-02 20:37:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2018-02-02 20:37:50,294 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 72 [2018-02-02 20:37:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:50,294 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2018-02-02 20:37:50,294 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:37:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2018-02-02 20:37:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 20:37:50,295 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:50,295 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:50,295 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:50,296 INFO L82 PathProgramCache]: Analyzing trace with hash 172589230, now seen corresponding path program 1 times [2018-02-02 20:37:50,296 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:50,307 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:50,447 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:50,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:37:50,447 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:50,448 INFO L182 omatonBuilderFactory]: Interpolants [12417#true, 12418#false, 12419#(= 0 |ldv_malloc_#t~malloc2.offset|), 12420#(= 0 |ldv_malloc_#res.offset|), 12421#(= 0 |entry_point_#t~ret24.offset|), 12422#(= 0 entry_point_~hdev~0.offset), 12423#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 12424#(and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 12425#(and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (or (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 12426#(or (<= 12 (select |#length| |ldv_arvo_init_specials_#in~hdev.base|)) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0))), 12427#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (<= 12 (select |#length| |ldv_arvo_probe_#in~hdev.base|))), 12428#(and (<= 12 (select |#length| entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 12429#(and (<= 12 (select |#length| |ldv_arvo_remove_#in~hdev.base|)) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 12430#(and (= 0 ldv_arvo_remove_~hdev.offset) (<= 12 (select |#length| ldv_arvo_remove_~hdev.base))), 12431#(and (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|) (<= 12 (select |#length| |lvd_arvo_remove_specials_#in~hdev.base|))), 12432#(and (= lvd_arvo_remove_specials_~hdev.offset 0) (<= 12 (select |#length| lvd_arvo_remove_specials_~hdev.base)))] [2018-02-02 20:37:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:50,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:37:50,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:37:50,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:37:50,448 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand 16 states. [2018-02-02 20:37:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:50,684 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-02-02 20:37:50,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 20:37:50,684 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-02-02 20:37:50,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:50,685 INFO L225 Difference]: With dead ends: 225 [2018-02-02 20:37:50,685 INFO L226 Difference]: Without dead ends: 225 [2018-02-02 20:37:50,685 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:37:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-02-02 20:37:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 206. [2018-02-02 20:37:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:37:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2018-02-02 20:37:50,690 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 72 [2018-02-02 20:37:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:50,690 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2018-02-02 20:37:50,690 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:37:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2018-02-02 20:37:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:37:50,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:50,691 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:50,691 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1645476210, now seen corresponding path program 1 times [2018-02-02 20:37:50,692 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:50,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:51,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:51,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-02-02 20:37:51,143 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:51,144 INFO L182 omatonBuilderFactory]: Interpolants [12872#true, 12873#false, 12874#(= 0 |ldv_malloc_#t~malloc2.offset|), 12875#(= 0 |ldv_malloc_#res.offset|), 12876#(= 0 |entry_point_#t~ret24.offset|), 12877#(= 0 entry_point_~hdev~0.offset), 12878#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (= 0 entry_point_~hdev~0.offset)), 12879#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)))) (= 0 entry_point_~hdev~0.offset)), 12880#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 12881#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base)), 12882#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 12883#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 12884#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 12885#(and (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 12886#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) 4)) (= (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)))))), 12887#(and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) 4) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))), 12888#(and (= |#valid| |old(#valid)|) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) 4))), 12889#(and (= |#valid| |old(#valid)|) (or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|))), 12890#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8)))) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 12891#(and (= 0 ldv_arvo_remove_~hdev.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) (+ 0 8))))), 12892#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 12893#(and (= lvd_arvo_remove_specials_~hdev.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))))), 12894#(= 1 (select |#valid| |lvd_arvo_remove_specials_#t~mem19.base|)), 12895#(= 1 (select |#valid| lvd_arvo_remove_specials_~intf~1.base))] [2018-02-02 20:37:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:37:51,144 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 20:37:51,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 20:37:51,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2018-02-02 20:37:51,145 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand 24 states. [2018-02-02 20:37:52,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:52,039 INFO L93 Difference]: Finished difference Result 233 states and 252 transitions. [2018-02-02 20:37:52,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-02 20:37:52,039 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-02-02 20:37:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:52,040 INFO L225 Difference]: With dead ends: 233 [2018-02-02 20:37:52,040 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 20:37:52,040 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=1209, Unknown=0, NotChecked=0, Total=1406 [2018-02-02 20:37:52,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 20:37:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 206. [2018-02-02 20:37:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:37:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 226 transitions. [2018-02-02 20:37:52,044 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 226 transitions. Word has length 74 [2018-02-02 20:37:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:52,045 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 226 transitions. [2018-02-02 20:37:52,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 20:37:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 226 transitions. [2018-02-02 20:37:52,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-02-02 20:37:52,045 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:52,045 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:52,046 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1645476209, now seen corresponding path program 1 times [2018-02-02 20:37:52,050 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:52,066 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:37:52,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:52,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:37:52,781 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:37:52,782 INFO L182 omatonBuilderFactory]: Interpolants [13376#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13377#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13378#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13379#(and (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13380#(and (or (= (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)))) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) 4) (= (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))) (= (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)))))), 13381#(and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) 4) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (or (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|)) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) 4)) (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))), 13382#(and (or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (= |old(#length)| |#length|)), 13383#(and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= |old(#length)| |#length|)), 13384#(and (<= 8 (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8))) (= 0 |ldv_arvo_remove_#in~hdev.offset|) (<= (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8))))), 13385#(and (<= 8 (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) (+ 0 8))) (= 0 ldv_arvo_remove_~hdev.offset) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) (+ 0 8))))), 13386#(and (<= (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)) (select |#length| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|) (<= 8 (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)))), 13387#(and (<= 8 (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (<= (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (select |#length| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)))) (= lvd_arvo_remove_specials_~hdev.offset 0)), 13388#(and (<= 8 |lvd_arvo_remove_specials_#t~mem19.offset|) (<= |lvd_arvo_remove_specials_#t~mem19.offset| (select |#length| |lvd_arvo_remove_specials_#t~mem19.base|))), 13389#(and (<= (+ lvd_arvo_remove_specials_~intf~1.offset 8) (select |#length| lvd_arvo_remove_specials_~intf~1.base)) (<= 0 lvd_arvo_remove_specials_~intf~1.offset)), 13363#true, 13364#false, 13365#(= 0 |ldv_malloc_#t~malloc2.offset|), 13366#(= 0 |ldv_malloc_#res.offset|), 13367#(= 0 |entry_point_#t~ret24.offset|), 13368#(= 0 entry_point_~hdev~0.offset), 13369#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (div ldv_malloc_~size 4294967296) 0))), 13370#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 13371#(and (= entry_point_~hdev~0.offset 0) (= entry_point_~intf~2.offset 0)), 13372#(and (<= (+ entry_point_~intf~2.offset 8) (select |#length| entry_point_~intf~2.base)) (= entry_point_~hdev~0.offset 0) (= entry_point_~intf~2.offset 0)), 13373#(and (= entry_point_~hdev~0.offset 0) (<= 8 (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (<= (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))))), 13374#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13375#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |old(#length)| |#length|) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 20:37:52,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:37:52,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:37:52,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:37:52,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:37:52,782 INFO L87 Difference]: Start difference. First operand 206 states and 226 transitions. Second operand 27 states. [2018-02-02 20:37:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:54,161 INFO L93 Difference]: Finished difference Result 241 states and 260 transitions. [2018-02-02 20:37:54,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:37:54,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 74 [2018-02-02 20:37:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:54,162 INFO L225 Difference]: With dead ends: 241 [2018-02-02 20:37:54,162 INFO L226 Difference]: Without dead ends: 241 [2018-02-02 20:37:54,163 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=1661, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:37:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-02 20:37:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 206. [2018-02-02 20:37:54,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:37:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 225 transitions. [2018-02-02 20:37:54,167 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 225 transitions. Word has length 74 [2018-02-02 20:37:54,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:54,167 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 225 transitions. [2018-02-02 20:37:54,167 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:37:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 225 transitions. [2018-02-02 20:37:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:37:54,168 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:54,168 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:54,168 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:54,168 INFO L82 PathProgramCache]: Analyzing trace with hash 529845023, now seen corresponding path program 1 times [2018-02-02 20:37:54,169 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:54,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:37:55,184 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:55,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-02-02 20:37:55,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:37:55,185 INFO L182 omatonBuilderFactory]: Interpolants [13888#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13889#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13890#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13891#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13892#(and (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 13893#(or (and (or (= (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) 4)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) 4) (= (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)))) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)))))) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))), 13894#(or (and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) 4) (= (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|)) (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|))))) (or (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0))), 13895#(or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (= |#valid| |old(#valid)|) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 13896#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (= |#valid| |old(#valid)|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (or (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) 4)))), 13897#(and (= entry_point_~hdev~0.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4))))), 13898#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) (+ 0 8)) (- 8)) 4)))) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 13899#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) (+ 0 8)) (- 8)) 4)))) (= 0 ldv_arvo_remove_~hdev.offset)), 13900#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8))) (+ (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 8)) (- 8)) 4)))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 13901#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (- 8)) 4)))) (= lvd_arvo_remove_specials_~hdev.offset 0)), 13902#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#t~mem19.base|) (+ (+ |lvd_arvo_remove_specials_#t~mem19.offset| (- 8)) 4)))), 13903#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~intf~1.base) (+ lvd_arvo_remove_specials_~intf~1.offset 4)))), 13904#(= 1 (select |#valid| |lvd_arvo_remove_specials_#t~mem20.base|)), 13871#true, 13872#false, 13873#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 13874#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 13875#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|)), 13876#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 13877#(= |#valid| |old(#valid)|), 13878#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 13879#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 13880#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 entry_point_~hdev~0.offset)), 13881#(and (= (select |#valid| entry_point_~intf~2.base) 1) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13882#(and (= 1 (select |#valid| |entry_point_#t~ret26.base|)) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|)) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13883#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13884#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13885#(and (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 13886#(and (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)))) (= 0 entry_point_~hdev~0.offset)), 13887#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))] [2018-02-02 20:37:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:37:55,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 20:37:55,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 20:37:55,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:37:55,186 INFO L87 Difference]: Start difference. First operand 206 states and 225 transitions. Second operand 34 states. [2018-02-02 20:37:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:37:57,370 INFO L93 Difference]: Finished difference Result 231 states and 250 transitions. [2018-02-02 20:37:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 20:37:57,370 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-02-02 20:37:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:37:57,371 INFO L225 Difference]: With dead ends: 231 [2018-02-02 20:37:57,371 INFO L226 Difference]: Without dead ends: 231 [2018-02-02 20:37:57,372 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=358, Invalid=3064, Unknown=0, NotChecked=0, Total=3422 [2018-02-02 20:37:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-02-02 20:37:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 206. [2018-02-02 20:37:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:37:57,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 224 transitions. [2018-02-02 20:37:57,376 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 224 transitions. Word has length 75 [2018-02-02 20:37:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:37:57,376 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 224 transitions. [2018-02-02 20:37:57,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 20:37:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 224 transitions. [2018-02-02 20:37:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-02-02 20:37:57,377 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:37:57,377 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:37:57,377 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:37:57,377 INFO L82 PathProgramCache]: Analyzing trace with hash 529845024, now seen corresponding path program 1 times [2018-02-02 20:37:57,378 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:37:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:37:57,402 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:37:58,955 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:58,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:37:58,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:37:58,955 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:37:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:58,956 INFO L182 omatonBuilderFactory]: Interpolants [14400#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 14401#(and (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 14402#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 14403#(and (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)))) (<= 8 (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (= 0 entry_point_~hdev~0.offset) (<= (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) 8)), 14404#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14405#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14406#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (or (and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_arvo_init_specials_~hdev.offset 0)))), 14407#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (or (and (= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) |ldv_arvo_init_specials_#t~mem14.offset|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) |ldv_arvo_init_specials_#t~mem14.base|)) (not (= ldv_arvo_init_specials_~hdev.offset 0)))), 14408#(and (or (and (or (and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~intf~0.base (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (- (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))))) (+ ldv_arvo_init_specials_~intf~0.offset 8)) (<= (+ ldv_arvo_init_specials_~intf~0.offset 8) (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ ldv_arvo_init_specials_~hdev.offset 9) (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (+ ldv_arvo_init_specials_~hdev.offset 7))) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 14409#(and (or (and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (or (<= (+ ldv_arvo_init_specials_~hdev.offset 9) (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |ldv_arvo_init_specials_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (- (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)))))) 8)) 4))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_init_specials_#t~mem15.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) 8)) 4)))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (+ ldv_arvo_init_specials_~hdev.offset 7))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 14410#(and (or (and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (or (and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (- (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)))))) 8)) 4)) 7)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (- (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)))))) 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (+ (- (+ (- (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) 8)) 4))))) (<= (+ ldv_arvo_init_specials_~hdev.offset 9) (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8))) (<= (select (select |#memory_$Pointer$.offset| ldv_arvo_init_specials_~hdev.base) (+ ldv_arvo_init_specials_~hdev.offset 8)) (+ ldv_arvo_init_specials_~hdev.offset 7)))) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 14411#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14412#(and (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 14413#(and (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) 4)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)))) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (or (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) 4) (= (select |old(#memory_$Pointer$.offset)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|)) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (store (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)) (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_dev_set_drvdata_#in~dev.base|) (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|)))))), 14414#(and (or (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) 4) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (= (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|))) (or (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|)) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) 4)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (store (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|))))) (= (store (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_hid_set_drvdata_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|)) (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 14415#(or (= (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8))))) |ldv_arvo_init_specials_#in~hdev.base|) (<= 9 (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8))) (<= (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)) 7) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (and (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8))) 8)) 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 8)))))) 8)) 4)) 7)) (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_init_specials_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|)) 4)))), 14416#(or (= (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8))))) |ldv_arvo_probe_#in~hdev.base|) (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (<= (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)) 7) (<= 9 (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8))) (and (= (store (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (or (= (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) 4)) (= (store (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (@diff (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)))) (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|)) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) 8)) 4)) 7)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |old(#memory_$Pointer$.base)| |ldv_arvo_probe_#in~hdev.base|) (- (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8)))))) (+ (- (+ (- (select (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 8))) 8)) 4)))) (or (= (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) (<= (@diff (select |old(#memory_$Pointer$.offset)| |ldv_arvo_probe_#in~hdev.base|) (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|)) 4)))), 14417#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)) 7)) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8)) (- 8)) 4)))) (= entry_point_~hdev~0.offset 0)), 14418#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) 8) (- 8)) 4)) 7)) (= 0 |ldv_arvo_remove_#in~hdev.offset|) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) 8) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) 8) (- 8)) 4))))), 14419#(and (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) 8) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) 8) (- 8)) 4)))) (= 0 ldv_arvo_remove_~hdev.offset) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) 8) (- 8)) 4)) 7))), 14420#(and (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) 8) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) 8) (- 8)) 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) 8)) (+ (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) 8) (- 8)) 4)) 7)) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 14421#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (- 8)) 4)) 7)) (= lvd_arvo_remove_specials_~hdev.offset 0) (<= (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8))) (+ (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ lvd_arvo_remove_specials_~hdev.offset 8)) (- 8)) 4))))), 14422#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#t~mem19.base|) (+ (+ |lvd_arvo_remove_specials_#t~mem19.offset| (- 8)) 4)) 7)) (<= (+ (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#t~mem19.base|) (+ (+ |lvd_arvo_remove_specials_#t~mem19.offset| (- 8)) 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#t~mem19.base|) (+ (+ |lvd_arvo_remove_specials_#t~mem19.offset| (- 8)) 4))))), 14423#(and (<= (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~intf~1.base) (+ lvd_arvo_remove_specials_~intf~1.offset 4)) 8) (select |#length| (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~intf~1.base) (+ lvd_arvo_remove_specials_~intf~1.offset 4)))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~intf~1.base) (+ lvd_arvo_remove_specials_~intf~1.offset 4)) 7))), 14424#(and (<= 0 (+ |lvd_arvo_remove_specials_#t~mem20.offset| 7)) (<= (+ |lvd_arvo_remove_specials_#t~mem20.offset| 8) (select |#length| |lvd_arvo_remove_specials_#t~mem20.base|))), 14392#true, 14393#false, 14394#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|)), 14395#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 14396#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= 0 |entry_point_#t~ret24.offset|)), 14397#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 14398#(= |#valid| |old(#valid)|), 14399#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)))] [2018-02-02 20:37:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:37:58,956 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:37:58,956 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:37:58,957 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=980, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:37:58,957 INFO L87 Difference]: Start difference. First operand 206 states and 224 transitions. Second operand 33 states. [2018-02-02 20:38:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:02,276 INFO L93 Difference]: Finished difference Result 260 states and 282 transitions. [2018-02-02 20:38:02,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-02-02 20:38:02,276 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 75 [2018-02-02 20:38:02,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:02,277 INFO L225 Difference]: With dead ends: 260 [2018-02-02 20:38:02,277 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 20:38:02,277 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=407, Invalid=4149, Unknown=0, NotChecked=0, Total=4556 [2018-02-02 20:38:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 20:38:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 206. [2018-02-02 20:38:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:38:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-02-02 20:38:02,280 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 75 [2018-02-02 20:38:02,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:02,280 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-02-02 20:38:02,280 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:38:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-02-02 20:38:02,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-02-02 20:38:02,281 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:02,281 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:02,281 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:02,281 INFO L82 PathProgramCache]: Analyzing trace with hash -90629135, now seen corresponding path program 1 times [2018-02-02 20:38:02,281 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:02,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:02,405 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:02,405 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:38:02,405 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:02,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:02,406 INFO L182 omatonBuilderFactory]: Interpolants [14962#true, 14963#false, 14964#(not (= |ldv_zalloc_#t~malloc3.base| 0)), 14965#(not (= |ldv_zalloc_#res.base| 0)), 14966#(not (= |ldv_arvo_init_specials_#t~ret17.base| 0)), 14967#(not (= ldv_arvo_init_specials_~arvo~0.base 0))] [2018-02-02 20:38:02,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:02,406 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:02,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:02,406 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:02,406 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 6 states. [2018-02-02 20:38:02,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:02,417 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-02-02 20:38:02,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:38:02,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-02-02 20:38:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:02,418 INFO L225 Difference]: With dead ends: 197 [2018-02-02 20:38:02,418 INFO L226 Difference]: Without dead ends: 197 [2018-02-02 20:38:02,418 INFO L554 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-02-02 20:38:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-02-02 20:38:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-02-02 20:38:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-02-02 20:38:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 211 transitions. [2018-02-02 20:38:02,421 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 211 transitions. Word has length 73 [2018-02-02 20:38:02,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:02,421 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 211 transitions. [2018-02-02 20:38:02,421 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:02,421 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2018-02-02 20:38:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:38:02,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:02,422 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:02,422 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:02,422 INFO L82 PathProgramCache]: Analyzing trace with hash 217510894, now seen corresponding path program 1 times [2018-02-02 20:38:02,423 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:02,433 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:02,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:02,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:38:02,609 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:02,609 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:02,610 INFO L182 omatonBuilderFactory]: Interpolants [15364#true, 15365#false, 15366#(= 1 (select |#valid| lvd_arvo_remove_specials_~hdev.base)), 15367#(= 1 (select |#valid| |ldv_hid_get_drvdata_#in~hdev.base|)), 15368#(= 1 (select |#valid| ldv_hid_get_drvdata_~hdev.base)), 15369#(= 1 (select |#valid| |ldv_dev_get_drvdata_#in~dev.base|)), 15370#(= 1 (select |#valid| ldv_dev_get_drvdata_~dev.base))] [2018-02-02 20:38:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:02,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:38:02,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:38:02,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:02,610 INFO L87 Difference]: Start difference. First operand 197 states and 211 transitions. Second operand 7 states. [2018-02-02 20:38:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:02,715 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2018-02-02 20:38:02,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:02,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-02-02 20:38:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:02,716 INFO L225 Difference]: With dead ends: 196 [2018-02-02 20:38:02,716 INFO L226 Difference]: Without dead ends: 196 [2018-02-02 20:38:02,716 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-02-02 20:38:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-02-02 20:38:02,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-02-02 20:38:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 20:38:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2018-02-02 20:38:02,718 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 81 [2018-02-02 20:38:02,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:02,719 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2018-02-02 20:38:02,719 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:38:02,719 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2018-02-02 20:38:02,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 20:38:02,719 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:02,719 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:02,719 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash 217510895, now seen corresponding path program 1 times [2018-02-02 20:38:02,720 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:02,734 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:03,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:03,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:38:03,029 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:03,029 INFO L182 omatonBuilderFactory]: Interpolants [15776#(or (<= 12 (select |#length| |ldv_arvo_init_specials_#in~hdev.base|)) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0))), 15777#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (<= 12 (select |#length| |ldv_arvo_probe_#in~hdev.base|))), 15778#(and (<= 12 (select |#length| entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 15779#(and (<= 12 (select |#length| |ldv_arvo_remove_#in~hdev.base|)) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 15780#(and (= 0 ldv_arvo_remove_~hdev.offset) (<= 12 (select |#length| ldv_arvo_remove_~hdev.base))), 15781#(and (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|) (<= 12 (select |#length| |lvd_arvo_remove_specials_#in~hdev.base|))), 15782#(and (<= 12 (select |#length| lvd_arvo_remove_specials_~hdev.base)) (= 0 lvd_arvo_remove_specials_~hdev.offset)), 15783#(and (= 0 |ldv_hid_get_drvdata_#in~hdev.offset|) (<= 12 (select |#length| |ldv_hid_get_drvdata_#in~hdev.base|))), 15784#(and (= 0 ldv_hid_get_drvdata_~hdev.offset) (<= 12 (select |#length| ldv_hid_get_drvdata_~hdev.base))), 15785#(and (= 0 |ldv_dev_get_drvdata_#in~dev.offset|) (<= 12 (select |#length| |ldv_dev_get_drvdata_#in~dev.base|))), 15786#(and (= ldv_dev_get_drvdata_~dev.offset 0) (<= 12 (select |#length| ldv_dev_get_drvdata_~dev.base))), 15767#true, 15768#false, 15769#(= 0 |ldv_malloc_#t~malloc2.offset|), 15770#(= 0 |ldv_malloc_#res.offset|), 15771#(= 0 |entry_point_#t~ret24.offset|), 15772#(= 0 entry_point_~hdev~0.offset), 15773#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 15774#(and (or (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0))), 15775#(and (or (not (= ldv_arvo_init_specials_~hdev.offset 0)) (and (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|))) (or (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.offset 0)))] [2018-02-02 20:38:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:03,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:38:03,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:38:03,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:38:03,030 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand 20 states. [2018-02-02 20:38:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:03,519 INFO L93 Difference]: Finished difference Result 221 states and 232 transitions. [2018-02-02 20:38:03,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:38:03,519 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 81 [2018-02-02 20:38:03,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:03,520 INFO L225 Difference]: With dead ends: 221 [2018-02-02 20:38:03,520 INFO L226 Difference]: Without dead ends: 221 [2018-02-02 20:38:03,521 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2018-02-02 20:38:03,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-02-02 20:38:03,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 206. [2018-02-02 20:38:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 20:38:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 219 transitions. [2018-02-02 20:38:03,524 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 219 transitions. Word has length 81 [2018-02-02 20:38:03,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:03,524 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 219 transitions. [2018-02-02 20:38:03,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:38:03,525 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 219 transitions. [2018-02-02 20:38:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:38:03,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:03,525 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:03,526 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash 790903974, now seen corresponding path program 1 times [2018-02-02 20:38:03,526 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:03,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:04,113 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:04,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:38:04,113 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:04,113 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:04,113 INFO L182 omatonBuilderFactory]: Interpolants [16226#true, 16227#false, 16228#(= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1), 16229#(= (select |#valid| |ldv_malloc_#res.base|) 1), 16230#(= (select |#valid| |entry_point_#t~ret24.base|) 1), 16231#(= (select |#valid| entry_point_~hdev~0.base) 1), 16232#(= |#valid| |old(#valid)|), 16233#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 16234#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 16235#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|))), 16236#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16237#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 16238#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 16239#(and (= 0 |entry_point_#t~ret26.offset|) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|)) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16240#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16241#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16242#(and (= 0 (select (select (store |#memory_$Pointer$.offset| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) (+ entry_point_~intf~2.offset 8))) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16243#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 16244#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16245#(and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16246#(and (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16247#(and (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 16248#(and (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 16249#(and (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_hid_set_drvdata_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 16250#(and (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 16251#(and (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 16252#(= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))), 16253#(= |entry_point_#t~mem34.offset| 0)] [2018-02-02 20:38:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:04,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:38:04,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:38:04,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:38:04,114 INFO L87 Difference]: Start difference. First operand 206 states and 219 transitions. Second operand 28 states. [2018-02-02 20:38:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:05,182 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-02 20:38:05,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:38:05,182 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 82 [2018-02-02 20:38:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:05,182 INFO L225 Difference]: With dead ends: 229 [2018-02-02 20:38:05,182 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 20:38:05,183 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=291, Invalid=2361, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 20:38:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 20:38:05,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 209. [2018-02-02 20:38:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-02-02 20:38:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 224 transitions. [2018-02-02 20:38:05,185 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 224 transitions. Word has length 82 [2018-02-02 20:38:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:05,185 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 224 transitions. [2018-02-02 20:38:05,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:38:05,186 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 224 transitions. [2018-02-02 20:38:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-02-02 20:38:05,186 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:05,186 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:05,186 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:05,186 INFO L82 PathProgramCache]: Analyzing trace with hash 790903975, now seen corresponding path program 1 times [2018-02-02 20:38:05,187 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:05,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:05,675 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:05,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:05,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 20:38:05,676 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:05,677 INFO L182 omatonBuilderFactory]: Interpolants [16741#true, 16742#false, 16743#(= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1), 16744#(= (select |#valid| |ldv_malloc_#res.base|) 1), 16745#(= (select |#valid| |entry_point_#t~ret24.base|) 1), 16746#(= (select |#valid| entry_point_~hdev~0.base) 1), 16747#(= |#valid| |old(#valid)|), 16748#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 16749#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 16750#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|))), 16751#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16752#(and (= 1 (select |#valid| |entry_point_#t~ret26.base|)) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|)) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16753#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16754#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16755#(and (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 16756#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16757#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16758#(and (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16759#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 16760#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 16761#(and (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 16762#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 16763#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|))), 16764#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 16765#(and (= |#valid| |old(#valid)|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 16766#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))), 16767#(= 1 (select |#valid| |entry_point_#t~mem34.base|))] [2018-02-02 20:38:05,677 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:05,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:38:05,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:38:05,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:38:05,678 INFO L87 Difference]: Start difference. First operand 209 states and 224 transitions. Second operand 27 states. [2018-02-02 20:38:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:06,575 INFO L93 Difference]: Finished difference Result 219 states and 236 transitions. [2018-02-02 20:38:06,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 20:38:06,575 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 82 [2018-02-02 20:38:06,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:06,576 INFO L225 Difference]: With dead ends: 219 [2018-02-02 20:38:06,576 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 20:38:06,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:38:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 20:38:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 210. [2018-02-02 20:38:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 20:38:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-02-02 20:38:06,580 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 82 [2018-02-02 20:38:06,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:06,580 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-02-02 20:38:06,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:38:06,580 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-02-02 20:38:06,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:38:06,581 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:06,581 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:06,581 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:06,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1859667754, now seen corresponding path program 1 times [2018-02-02 20:38:06,582 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:06,593 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:06,631 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:06,631 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:38:06,631 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:06,632 INFO L182 omatonBuilderFactory]: Interpolants [17232#(not (= |ldv_arvo_init_arvo_device_struct_#t~ret13| 0)), 17233#(not (= |ldv_arvo_init_arvo_device_struct_#res| 0)), 17234#(not (= |ldv_arvo_init_specials_#t~ret18| 0)), 17235#(not (= ldv_arvo_init_specials_~retval~0 0)), 17229#true, 17230#false, 17231#(not (= |ldv_nonpositive_#res| 0))] [2018-02-02 20:38:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:06,632 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:38:06,632 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:38:06,632 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:06,632 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 7 states. [2018-02-02 20:38:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:06,644 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-02 20:38:06,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:06,644 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-02-02 20:38:06,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:06,645 INFO L225 Difference]: With dead ends: 217 [2018-02-02 20:38:06,645 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 20:38:06,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:06,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 20:38:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-02 20:38:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 20:38:06,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-02 20:38:06,647 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 85 [2018-02-02 20:38:06,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:06,648 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-02 20:38:06,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:38:06,648 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-02 20:38:06,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:38:06,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:06,648 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:06,648 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:06,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2141896535, now seen corresponding path program 1 times [2018-02-02 20:38:06,649 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:06,658 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:06,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:06,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 20:38:06,769 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:06,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:06,769 INFO L182 omatonBuilderFactory]: Interpolants [17680#(or (<= 12 (select |#length| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|)) (not (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| 0))), 17670#true, 17671#false, 17672#(and (or (and (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|) 4294967296)) (< (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647) ldv_zalloc_~size)) (and (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|))))) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 17673#(= |#Ultimate.meminit_#t~loopctr35| 0), 17674#(<= |#Ultimate.meminit_#product| 0), 17675#(and (<= (select |#length| |ldv_zalloc_#t~malloc3.base|) 0) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 17676#(and (<= (select |#length| |ldv_zalloc_#res.base|) 0) (= 0 |ldv_zalloc_#res.offset|)), 17677#(and (= 0 |ldv_arvo_init_specials_#t~ret17.offset|) (<= (select |#length| |ldv_arvo_init_specials_#t~ret17.base|) 0)), 17678#(and (<= (select |#length| ldv_arvo_init_specials_~arvo~0.base) 0) (= 0 ldv_arvo_init_specials_~arvo~0.offset)), 17679#(and (= ldv_arvo_init_arvo_device_struct_~arvo.base |ldv_arvo_init_arvo_device_struct_#in~arvo.base|) (or (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| ldv_arvo_init_arvo_device_struct_~arvo.offset) (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0)))] [2018-02-02 20:38:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:06,770 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 20:38:06,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 20:38:06,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 20:38:06,770 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 11 states. [2018-02-02 20:38:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:07,001 INFO L93 Difference]: Finished difference Result 226 states and 242 transitions. [2018-02-02 20:38:07,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:38:07,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-02-02 20:38:07,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:07,002 INFO L225 Difference]: With dead ends: 226 [2018-02-02 20:38:07,002 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 20:38:07,002 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:38:07,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 20:38:07,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 20:38:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 20:38:07,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-02 20:38:07,006 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 85 [2018-02-02 20:38:07,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:07,006 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-02 20:38:07,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 20:38:07,006 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-02 20:38:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-02-02 20:38:07,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:07,007 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:07,007 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash -150489879, now seen corresponding path program 1 times [2018-02-02 20:38:07,007 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:07,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:07,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:07,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:38:07,543 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:07,543 INFO L182 omatonBuilderFactory]: Interpolants [18133#true, 18134#false, 18135#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 18136#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 18137#(= 1 (select |#valid| |entry_point_#t~ret24.base|)), 18138#(= 1 (select |#valid| entry_point_~hdev~0.base)), 18139#(= |#valid| |old(#valid)|), 18140#(and (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 18141#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 18142#(and (= 1 (select |#valid| |entry_point_#t~ret25.base|)) (not (= |entry_point_#t~ret25.base| entry_point_~hdev~0.base))), 18143#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 18144#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 18145#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 18146#(and (not (= |entry_point_#t~ret26.base| 0)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 18147#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= 1 (select |#valid| entry_point_~intf~2.base)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 18148#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 1 (select |#valid| entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 18149#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18150#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base)), 18151#(and (= |ldv_arvo_init_specials_#in~hdev.base| ldv_arvo_init_specials_~hdev.base) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18152#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 18153#(and (= |ldv_hid_set_drvdata_#in~hdev.base| ldv_hid_set_drvdata_~hdev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18154#(and (= |ldv_dev_set_drvdata_#in~dev.base| ldv_dev_set_drvdata_~dev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 18155#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_dev_set_drvdata_#in~dev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 18156#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_hid_set_drvdata_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 18157#(and (= |#valid| |old(#valid)|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_init_specials_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 18158#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_arvo_probe_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 18159#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 1 (select |#valid| entry_point_~intf~2.base))), 18160#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem34.base|)) (= 1 (select |#valid| entry_point_~intf~2.base))), 18161#(= 1 (select |#valid| entry_point_~intf~2.base))] [2018-02-02 20:38:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:07,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:38:07,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:38:07,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:38:07,544 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 29 states. [2018-02-02 20:38:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:08,343 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2018-02-02 20:38:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:38:08,343 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2018-02-02 20:38:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:08,344 INFO L225 Difference]: With dead ends: 220 [2018-02-02 20:38:08,344 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 20:38:08,344 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=217, Invalid=1675, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:38:08,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 20:38:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-02 20:38:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 20:38:08,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2018-02-02 20:38:08,346 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 84 [2018-02-02 20:38:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:08,347 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2018-02-02 20:38:08,347 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:38:08,347 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2018-02-02 20:38:08,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:38:08,347 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:08,347 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:08,347 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:08,347 INFO L82 PathProgramCache]: Analyzing trace with hash 997359006, now seen corresponding path program 1 times [2018-02-02 20:38:08,348 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:08,358 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:38:08,446 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:08,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 20:38:08,446 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:08,447 INFO L182 omatonBuilderFactory]: Interpolants [18640#(= 1 (select |#valid| |ldv_dev_set_drvdata_#in~dev.base|)), 18641#(= 1 (select |#valid| ldv_dev_set_drvdata_~dev.base)), 18632#true, 18633#false, 18634#(= 1 (select |#valid| ldv_arvo_init_specials_~hdev.base)), 18635#(= |#valid| |old(#valid)|), 18636#(and (= (store |old(#valid)| |ldv_zalloc_#t~malloc3.base| (select |#valid| |ldv_zalloc_#t~malloc3.base|)) |#valid|) (= 1 (select |#valid| |ldv_zalloc_#t~malloc3.base|))), 18637#(and (or (= 1 (select |#valid| (@diff |old(#valid)| |#valid|))) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 18638#(= 1 (select |#valid| |ldv_hid_set_drvdata_#in~hdev.base|)), 18639#(= 1 (select |#valid| ldv_hid_set_drvdata_~hdev.base))] [2018-02-02 20:38:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:38:08,447 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 20:38:08,447 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 20:38:08,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:38:08,448 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand 10 states. [2018-02-02 20:38:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:08,856 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2018-02-02 20:38:08,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 20:38:08,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2018-02-02 20:38:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:08,857 INFO L225 Difference]: With dead ends: 219 [2018-02-02 20:38:08,857 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 20:38:08,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:38:08,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 20:38:08,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-02-02 20:38:08,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:38:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-02 20:38:08,861 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 86 [2018-02-02 20:38:08,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:08,861 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-02 20:38:08,861 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 20:38:08,861 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-02 20:38:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 20:38:08,862 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:08,862 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:08,862 INFO L371 AbstractCegarLoop]: === Iteration 47 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash 997359007, now seen corresponding path program 1 times [2018-02-02 20:38:08,863 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:08,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 20:38:09,154 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:09,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-02-02 20:38:09,154 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:09,155 INFO L182 omatonBuilderFactory]: Interpolants [19104#(and (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)), 19105#(and (= 0 (select |old(#valid)| |ldv_zalloc_#t~malloc3.base|)) (= |#length| (store |old(#length)| |ldv_zalloc_#t~malloc3.base| (select |#length| |ldv_zalloc_#t~malloc3.base|)))), 19106#(and (or (= 0 (select |old(#valid)| (@diff |old(#length)| |#length|))) (= |old(#length)| |#length|)) (= |#length| (store |old(#length)| (@diff |old(#length)| |#length|) (select |#length| (@diff |old(#length)| |#length|))))), 19107#(and (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (= ldv_arvo_init_specials_~hdev.offset 0)), 19108#(and (= 0 |ldv_hid_set_drvdata_#in~hdev.offset|) (<= 12 (select |#length| |ldv_hid_set_drvdata_#in~hdev.base|))), 19109#(and (= 0 ldv_hid_set_drvdata_~hdev.offset) (<= 12 (select |#length| ldv_hid_set_drvdata_~hdev.base))), 19110#(and (= 0 |ldv_dev_set_drvdata_#in~dev.offset|) (<= 12 (select |#length| |ldv_dev_set_drvdata_#in~dev.base|))), 19111#(and (= ldv_dev_set_drvdata_~dev.offset 0) (<= 12 (select |#length| ldv_dev_set_drvdata_~dev.base))), 19092#true, 19093#false, 19094#(= 0 |ldv_malloc_#t~malloc2.offset|), 19095#(= 0 |ldv_malloc_#res.offset|), 19096#(= 0 |entry_point_#t~ret24.offset|), 19097#(= 0 entry_point_~hdev~0.offset), 19098#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (= 0 entry_point_~hdev~0.offset)), 19099#(and (= (select |#valid| |ldv_arvo_probe_#in~hdev.base|) 1) (= 0 |ldv_arvo_probe_#in~hdev.offset|)), 19100#(and (= (select |#valid| ldv_arvo_probe_~hdev.base) 1) (= 0 ldv_arvo_probe_~hdev.offset)), 19101#(and (= (select |#valid| |ldv_arvo_init_specials_#in~hdev.base|) 1) (= 0 |ldv_arvo_init_specials_#in~hdev.offset|)), 19102#(and (= ldv_arvo_init_specials_~hdev.offset 0) (= (select |#valid| ldv_arvo_init_specials_~hdev.base) 1)), 19103#(and (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (= ldv_arvo_init_specials_~hdev.offset 0) (= (select |#valid| ldv_arvo_init_specials_~hdev.base) 1))] [2018-02-02 20:38:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-02-02 20:38:09,155 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 20:38:09,155 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 20:38:09,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:38:09,156 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 20 states. [2018-02-02 20:38:09,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:09,962 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2018-02-02 20:38:09,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 20:38:09,962 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2018-02-02 20:38:09,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:09,963 INFO L225 Difference]: With dead ends: 218 [2018-02-02 20:38:09,963 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 20:38:09,964 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=999, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 20:38:09,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 20:38:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 20:38:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 20:38:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-02 20:38:09,968 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 86 [2018-02-02 20:38:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:09,968 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-02 20:38:09,968 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 20:38:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-02 20:38:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 20:38:09,968 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:09,969 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:09,969 INFO L371 AbstractCegarLoop]: === Iteration 48 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash -370218899, now seen corresponding path program 1 times [2018-02-02 20:38:09,970 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:09,980 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:10,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:10,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:38:10,665 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:10,665 INFO L182 omatonBuilderFactory]: Interpolants [19584#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 19585#(and (not (= |entry_point_#t~ret25.base| 0)) (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 19586#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~intf~2.base 0)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 19587#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 19588#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 19589#(and (not (= entry_point_~hdev~0.base |entry_point_#t~ret26.base|)) (not (= |entry_point_#t~ret26.base| 0)) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 19590#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 19591#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 19592#(and (not (= (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 19593#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 19594#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base)), 19595#(and (= |ldv_arvo_init_specials_#in~hdev.base| ldv_arvo_init_specials_~hdev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 19596#(and (= |ldv_hid_set_drvdata_#in~hdev.base| ldv_hid_set_drvdata_~hdev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 19597#(and (= |ldv_dev_set_drvdata_#in~dev.base| ldv_dev_set_drvdata_~dev.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 19598#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_dev_set_drvdata_#in~dev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 19599#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_hid_set_drvdata_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 19600#(and (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_init_specials_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 19601#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_arvo_probe_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 19602#(= |ldv_arvo_remove_#in~hdev.base| ldv_arvo_remove_~hdev.base), 19603#(= lvd_arvo_remove_specials_~hdev.base |lvd_arvo_remove_specials_#in~hdev.base|), 19604#(= 1 (select |#valid| |lvd_arvo_remove_specials_#in~hdev.base|)), 19605#(= 1 (select |#valid| |ldv_arvo_remove_#in~hdev.base|)), 19606#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 19607#(and (= 1 (select (store |#valid| |entry_point_#t~mem34.base| 0) entry_point_~hdev~0.base)) (not (= |entry_point_#t~mem34.base| 0)) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 19608#(and (= 1 (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~hdev~0.base)) (not (= 0 entry_point_~intf~2.base))), 19576#true, 19577#false, 19578#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 19579#(= (select |#valid| |ldv_malloc_#res.base|) 1), 19580#(= 1 (select |#valid| |entry_point_#t~ret24.base|)), 19581#(= 1 (select |#valid| entry_point_~hdev~0.base)), 19582#(= |#valid| |old(#valid)|), 19583#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|)))] [2018-02-02 20:38:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:10,666 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:38:10,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:38:10,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=954, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:38:10,666 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 33 states. [2018-02-02 20:38:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:12,142 INFO L93 Difference]: Finished difference Result 233 states and 246 transitions. [2018-02-02 20:38:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 20:38:12,143 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 85 [2018-02-02 20:38:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:12,143 INFO L225 Difference]: With dead ends: 233 [2018-02-02 20:38:12,144 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 20:38:12,144 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=429, Invalid=3477, Unknown=0, NotChecked=0, Total=3906 [2018-02-02 20:38:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 20:38:12,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 219. [2018-02-02 20:38:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:38:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-02 20:38:12,147 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 85 [2018-02-02 20:38:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:12,147 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-02 20:38:12,147 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:38:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-02 20:38:12,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:38:12,148 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:12,148 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:12,148 INFO L371 AbstractCegarLoop]: === Iteration 49 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1590719605, now seen corresponding path program 1 times [2018-02-02 20:38:12,149 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:12,162 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:12,657 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:12,657 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:12,657 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:38:12,658 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:12,658 INFO L182 omatonBuilderFactory]: Interpolants [20122#true, 20123#false, 20124#(= 0 |ldv_malloc_#t~malloc2.offset|), 20125#(= 0 |ldv_malloc_#res.offset|), 20126#(= 0 |entry_point_#t~ret24.offset|), 20127#(= 0 entry_point_~hdev~0.offset), 20128#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 20129#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 20130#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 20131#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|)), 20132#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|) (= ldv_hid_set_drvdata_~data.offset |ldv_hid_set_drvdata_#in~data.offset|)), 20133#(and (= ldv_dev_set_drvdata_~data.offset |ldv_dev_set_drvdata_#in~data.offset|) (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|)), 20134#(or (= (select (select |#memory_$Pointer$.offset| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_set_drvdata_#in~data.offset|) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))), 20135#(or (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_set_drvdata_#in~data.offset|)), 20136#(or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4)))), 20137#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4)))), 20138#(and (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ 0 4))) (= 0 entry_point_~hdev~0.offset)), 20139#(and (= 0 |ldv_arvo_remove_#in~hdev.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ldv_arvo_remove_#in~hdev.base|) (+ 0 4)))), 20140#(and (= 0 ldv_arvo_remove_~hdev.offset) (= 0 (select (select |#memory_$Pointer$.offset| ldv_arvo_remove_~hdev.base) (+ 0 4)))), 20141#(and (= 0 (select (select |#memory_$Pointer$.offset| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 4))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 20142#(and (= 0 (select (select |#memory_$Pointer$.offset| lvd_arvo_remove_specials_~hdev.base) (+ 0 4))) (= 0 lvd_arvo_remove_specials_~hdev.offset)), 20143#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 20144#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0)))), 20145#(or (= |ldv_dev_get_drvdata_#t~mem4.offset| (select (select |#memory_$Pointer$.offset| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4))) (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0))), 20146#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= |ldv_dev_get_drvdata_#res.offset| (select (select |#memory_$Pointer$.offset| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)))), 20147#(or (= |ldv_hid_get_drvdata_#t~ret6.offset| (select (select |#memory_$Pointer$.offset| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 20148#(or (= |ldv_hid_get_drvdata_#res.offset| (select (select |#memory_$Pointer$.offset| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 20149#(= 0 |lvd_arvo_remove_specials_#t~ret22.offset|), 20150#(= 0 lvd_arvo_remove_specials_~arvo~1.offset)] [2018-02-02 20:38:12,659 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:12,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:38:12,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:38:12,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:38:12,660 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 29 states. [2018-02-02 20:38:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:13,305 INFO L93 Difference]: Finished difference Result 229 states and 240 transitions. [2018-02-02 20:38:13,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:38:13,305 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-02-02 20:38:13,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:13,306 INFO L225 Difference]: With dead ends: 229 [2018-02-02 20:38:13,306 INFO L226 Difference]: Without dead ends: 229 [2018-02-02 20:38:13,306 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:38:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-02-02 20:38:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 219. [2018-02-02 20:38:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:38:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 233 transitions. [2018-02-02 20:38:13,308 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 233 transitions. Word has length 89 [2018-02-02 20:38:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:13,309 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 233 transitions. [2018-02-02 20:38:13,309 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:38:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 233 transitions. [2018-02-02 20:38:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-02-02 20:38:13,309 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:13,309 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:13,309 INFO L371 AbstractCegarLoop]: === Iteration 50 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:13,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1590719604, now seen corresponding path program 1 times [2018-02-02 20:38:13,310 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:13,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:13,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:13,815 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:13,815 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:38:13,815 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:13,815 INFO L182 omatonBuilderFactory]: Interpolants [20627#true, 20628#false, 20629#(= 0 |ldv_malloc_#t~malloc2.offset|), 20630#(= 0 |ldv_malloc_#res.offset|), 20631#(= 0 |entry_point_#t~ret24.offset|), 20632#(= 0 entry_point_~hdev~0.offset), 20633#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 20634#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 20635#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 20636#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|)), 20637#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |ldv_hid_set_drvdata_#in~data.base| ldv_hid_set_drvdata_~data.base) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 20638#(and (= |ldv_dev_set_drvdata_#in~data.base| ldv_dev_set_drvdata_~data.base) (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|)), 20639#(or (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (= |ldv_dev_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4)))), 20640#(or (= |ldv_hid_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0))), 20641#(or (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0))), 20642#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4)))), 20643#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ 0 4))) (= 0 entry_point_~hdev~0.offset)), 20644#(and (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ 0 4))) (= 0 |ldv_arvo_remove_#in~hdev.offset|)), 20645#(and (= 0 ldv_arvo_remove_~hdev.offset) (= 0 (select (select |#memory_$Pointer$.base| ldv_arvo_remove_~hdev.base) (+ 0 4)))), 20646#(and (= 0 (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ 0 4))) (= 0 |lvd_arvo_remove_specials_#in~hdev.offset|)), 20647#(and (= 0 (select (select |#memory_$Pointer$.base| lvd_arvo_remove_specials_~hdev.base) (+ 0 4))) (= 0 lvd_arvo_remove_specials_~hdev.offset)), 20648#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 20649#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0)))), 20650#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#t~mem4.base|)), 20651#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#res.base|)), 20652#(or (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#t~ret6.base|)), 20653#(or (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#res.base|) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 20654#(= 0 |lvd_arvo_remove_specials_#t~ret22.base|), 20655#(= lvd_arvo_remove_specials_~arvo~1.base 0)] [2018-02-02 20:38:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:13,816 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:38:13,816 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:38:13,816 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:38:13,816 INFO L87 Difference]: Start difference. First operand 219 states and 233 transitions. Second operand 29 states. [2018-02-02 20:38:14,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:14,492 INFO L93 Difference]: Finished difference Result 228 states and 239 transitions. [2018-02-02 20:38:14,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-02 20:38:14,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 89 [2018-02-02 20:38:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:14,493 INFO L225 Difference]: With dead ends: 228 [2018-02-02 20:38:14,493 INFO L226 Difference]: Without dead ends: 228 [2018-02-02 20:38:14,493 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 20:38:14,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-02-02 20:38:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 219. [2018-02-02 20:38:14,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 20:38:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 232 transitions. [2018-02-02 20:38:14,495 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 232 transitions. Word has length 89 [2018-02-02 20:38:14,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:14,496 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 232 transitions. [2018-02-02 20:38:14,496 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:38:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 232 transitions. [2018-02-02 20:38:14,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-02-02 20:38:14,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:14,496 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:14,497 INFO L371 AbstractCegarLoop]: === Iteration 51 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:14,497 INFO L82 PathProgramCache]: Analyzing trace with hash 284856192, now seen corresponding path program 1 times [2018-02-02 20:38:14,497 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:14,514 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:15,921 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:15,921 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-02-02 20:38:15,921 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:15,921 INFO L182 omatonBuilderFactory]: Interpolants [21131#true, 21132#false, 21133#(= |#valid| |old(#valid)|), 21134#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 21135#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 21136#(and (= (select |#valid| |entry_point_#t~ret24.base|) 1) (= (select |old(#valid)| |entry_point_#t~ret24.base|) 0) (not (= |entry_point_#t~ret24.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 21137#(and (= (select |#valid| entry_point_~hdev~0.base) 1) (not (= entry_point_~hdev~0.base 0)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 21138#(and (not (= |entry_point_#t~ret25.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret25.base|) 0) (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= 0 entry_point_~hdev~0.base)) (= (select |#valid| entry_point_~hdev~0.base) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= (store (store |old(#valid)| |entry_point_#t~ret25.base| (select |#valid| |entry_point_#t~ret25.base|)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 21139#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= (select |#valid| entry_point_~hdev~0.base) 1) (not (= entry_point_~intf~2.base 0)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (= (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 21140#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 21141#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))), 21142#(and (not (= entry_point_~hdev~0.base |entry_point_#t~ret26.base|)) (= (select |old(#valid)| |entry_point_#t~ret26.base|) 0) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |entry_point_#t~ret26.base| (select |#valid| |entry_point_#t~ret26.base|))) (not (= |entry_point_#t~ret26.base| 0)) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 21143#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 0) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))) (not (= 0 entry_point_~intf~2.base)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 21144#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 0) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 21145#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21146#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21147#(and (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21148#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 21149#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 21150#(and (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 21151#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 21152#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|))), 21153#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 21154#(and (= |#valid| |old(#valid)|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 21155#(and (= (select |old(#valid)| |entry_point_#t~mem34.base|) (select (store |#valid| |entry_point_#t~mem34.base| 0) |entry_point_#t~mem34.base|)) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (not (= entry_point_~intf~2.base |entry_point_#t~mem34.base|)) (not (= |entry_point_#t~mem34.base| 0)) (= (store (store (store |old(#valid)| |entry_point_#t~mem34.base| (select (store |#valid| |entry_point_#t~mem34.base| 0) |entry_point_#t~mem34.base|)) entry_point_~intf~2.base (select (store |#valid| |entry_point_#t~mem34.base| 0) entry_point_~intf~2.base)) entry_point_~hdev~0.base (select (store |#valid| |entry_point_#t~mem34.base| 0) entry_point_~hdev~0.base)) (store |#valid| |entry_point_#t~mem34.base| 0)) (not (= 0 entry_point_~intf~2.base)) (not (= |entry_point_#t~mem34.base| entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 21156#(and (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~intf~2.base)) (not (= 0 entry_point_~intf~2.base)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base)) (= (store |#valid| entry_point_~intf~2.base 0) (store (store |old(#valid)| entry_point_~intf~2.base (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~intf~2.base)) entry_point_~hdev~0.base (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~hdev~0.base)))), 21157#(and (= (select |old(#valid)| entry_point_~hdev~0.base) (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (= (select |old(#valid)| (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0))) (select (store |#valid| entry_point_~hdev~0.base 0) (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0)))) (not (= 0 entry_point_~hdev~0.base)))] [2018-02-02 20:38:15,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:15,922 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 20:38:15,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 20:38:15,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2018-02-02 20:38:15,922 INFO L87 Difference]: Start difference. First operand 219 states and 232 transitions. Second operand 27 states. [2018-02-02 20:38:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:17,401 INFO L93 Difference]: Finished difference Result 222 states and 234 transitions. [2018-02-02 20:38:17,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:38:17,401 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 88 [2018-02-02 20:38:17,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:17,402 INFO L225 Difference]: With dead ends: 222 [2018-02-02 20:38:17,402 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 20:38:17,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=206, Invalid=1686, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:38:17,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 20:38:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-02 20:38:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 20:38:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 222 transitions. [2018-02-02 20:38:17,406 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 222 transitions. Word has length 88 [2018-02-02 20:38:17,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:17,406 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 222 transitions. [2018-02-02 20:38:17,406 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 20:38:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 222 transitions. [2018-02-02 20:38:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:38:17,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:17,407 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:17,407 INFO L371 AbstractCegarLoop]: === Iteration 52 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash -487038867, now seen corresponding path program 1 times [2018-02-02 20:38:17,408 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:17,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:17,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:17,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-02-02 20:38:17,946 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:17,946 INFO L182 omatonBuilderFactory]: Interpolants [21632#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset)), 21633#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (= 0 entry_point_~hdev~0.offset)), 21634#(= |#valid| |old(#valid)|), 21635#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#valid| |old(#valid)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 21636#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|)), 21637#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |ldv_hid_set_drvdata_#in~data.base| ldv_hid_set_drvdata_~data.base) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 21638#(and (= |ldv_dev_set_drvdata_#in~data.base| ldv_dev_set_drvdata_~data.base) (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|)), 21639#(or (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (= |ldv_dev_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4)))), 21640#(or (= |ldv_hid_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0))), 21641#(or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4))) (= |#valid| |old(#valid)|))), 21642#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (and (= |#valid| |old(#valid)|) (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4))))), 21643#(and (= 0 (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ 0 4))) (= 1 (select |#valid| entry_point_~intf~2.base)) (= 0 entry_point_~hdev~0.offset)), 21644#(and (= |#valid| |old(#valid)|) (= |ldv_arvo_remove_#in~hdev.offset| ldv_arvo_remove_~hdev.offset) (= |ldv_arvo_remove_#in~hdev.base| ldv_arvo_remove_~hdev.base)), 21645#(and (= |lvd_arvo_remove_specials_#in~hdev.offset| lvd_arvo_remove_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= |lvd_arvo_remove_specials_#in~hdev.base| lvd_arvo_remove_specials_~hdev.base)), 21646#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 21647#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0)))), 21648#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#t~mem4.base|)), 21649#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#res.base|)), 21650#(or (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#t~ret6.base|)), 21651#(or (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#res.base|) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 21652#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) |lvd_arvo_remove_specials_#t~ret22.base|) (= |#valid| |old(#valid)|))), 21653#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= |#valid| |old(#valid)|) (= lvd_arvo_remove_specials_~arvo~1.base (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4))))), 21654#(or (not (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) 0)) (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (= |#valid| |old(#valid)|)), 21655#(or (not (= (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ (- 0) 4)) 0)) (= |#valid| |old(#valid)|) (not (= |ldv_arvo_remove_#in~hdev.offset| 0))), 21656#(= 1 (select |#valid| entry_point_~intf~2.base)), 21624#true, 21625#false, 21626#(= 0 |ldv_malloc_#t~malloc2.offset|), 21627#(= 0 |ldv_malloc_#res.offset|), 21628#(= 0 |entry_point_#t~ret24.offset|), 21629#(= 0 entry_point_~hdev~0.offset), 21630#(and (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 21631#(and (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset))] [2018-02-02 20:38:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-02-02 20:38:17,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-02-02 20:38:17,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-02-02 20:38:17,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2018-02-02 20:38:17,947 INFO L87 Difference]: Start difference. First operand 210 states and 222 transitions. Second operand 33 states. [2018-02-02 20:38:18,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:18,906 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2018-02-02 20:38:18,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 20:38:18,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-02-02 20:38:18,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:18,906 INFO L225 Difference]: With dead ends: 211 [2018-02-02 20:38:18,906 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:38:18,907 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=2150, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:38:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:38:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 210. [2018-02-02 20:38:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 20:38:18,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 221 transitions. [2018-02-02 20:38:18,909 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 221 transitions. Word has length 94 [2018-02-02 20:38:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:18,909 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 221 transitions. [2018-02-02 20:38:18,909 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-02-02 20:38:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 221 transitions. [2018-02-02 20:38:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:38:18,909 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:18,909 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:18,909 INFO L371 AbstractCegarLoop]: === Iteration 53 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:18,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2081664383, now seen corresponding path program 1 times [2018-02-02 20:38:18,910 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:18,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:20,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:20,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 20:38:20,087 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:20,087 INFO L182 omatonBuilderFactory]: Interpolants [22144#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#t~mem4.base|)), 22145#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#res.base|)), 22146#(or (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#t~ret6.base|)), 22147#(or (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#res.base|) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 22148#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) |lvd_arvo_remove_specials_#t~ret22.base|) (= |#valid| |old(#valid)|))), 22149#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) lvd_arvo_remove_specials_~arvo~1.base) (= |#valid| |old(#valid)|))), 22150#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (or (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= (select |old(#valid)| 0) 1)), 22151#(or (= (select |old(#valid)| 0) 1) (and (or (= |#valid| |old(#valid)|) (= (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ (- 0) 4)) (@diff |old(#valid)| |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (not (= |ldv_arvo_remove_#in~hdev.offset| 0))), 22152#(and (= entry_point_~intf~2.offset 0) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 22153#(= 1 (select |#valid| |entry_point_#t~mem34.base|)), 22110#true, 22111#false, 22112#(= (select |#valid| 0) 0), 22113#(= (select |old(#valid)| 0) (select |#valid| 0)), 22114#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 22115#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 22116#(and (= 0 |entry_point_#t~ret24.offset|) (= (select |#valid| 0) 0) (= 1 (select |#valid| |entry_point_#t~ret24.base|))), 22117#(and (= (select |#valid| 0) 0) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| entry_point_~hdev~0.base))), 22118#(= |#valid| |old(#valid)|), 22119#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 22120#(and (= 0 |ldv_malloc_#res.offset|) (= (select |old(#valid)| 0) (select |#valid| 0)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 22121#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (= 0 (select |#valid| 0)) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset)), 22122#(and (= (select |#valid| entry_point_~intf~2.base) 1) (= 0 (select |#valid| 0)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset)), 22123#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 22124#(and (= (select |old(#valid)| 0) (select |#valid| 0)) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 22125#(and (= 0 (select |#valid| 0)) (= 1 (select |#valid| |entry_point_#t~ret26.base|)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 22126#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 (select |#valid| 0)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset)), 22127#(and (= 0 (select |#valid| 0)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 entry_point_~hdev~0.offset)), 22128#(and (= 0 (select |#valid| 0)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 22129#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 22130#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |ldv_arvo_probe_#in~hdev.base| ldv_arvo_probe_~hdev.base)), 22131#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 22132#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 22133#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |ldv_hid_set_drvdata_#in~data.base| ldv_hid_set_drvdata_~data.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 22134#(and (or (and (= |ldv_dev_set_drvdata_#in~data.base| ldv_dev_set_drvdata_~data.base) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (not (= ldv_dev_set_drvdata_~dev.offset 0))) (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset))), 22135#(or (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_dev_set_drvdata_#in~dev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |ldv_dev_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4)))) (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0))), 22136#(or (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (and (= |ldv_hid_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |ldv_hid_set_drvdata_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 22137#(or (and (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4))) (= |#valid| |old(#valid)|) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_init_specials_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0))), 22138#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4))) (or (= |ldv_arvo_probe_#in~hdev.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 22139#(and (= 0 (select |#valid| 0)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~intf~2.offset 4))))), 22140#(and (= |#valid| |old(#valid)|) (= |ldv_arvo_remove_#in~hdev.offset| ldv_arvo_remove_~hdev.offset) (= |ldv_arvo_remove_#in~hdev.base| ldv_arvo_remove_~hdev.base)), 22141#(and (= |lvd_arvo_remove_specials_#in~hdev.offset| lvd_arvo_remove_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= |lvd_arvo_remove_specials_#in~hdev.base| lvd_arvo_remove_specials_~hdev.base)), 22142#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 22143#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0))))] [2018-02-02 20:38:20,087 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:20,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 20:38:20,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 20:38:20,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1750, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:38:20,088 INFO L87 Difference]: Start difference. First operand 210 states and 221 transitions. Second operand 44 states. [2018-02-02 20:38:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:22,446 INFO L93 Difference]: Finished difference Result 210 states and 220 transitions. [2018-02-02 20:38:22,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-02-02 20:38:22,447 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 95 [2018-02-02 20:38:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:22,447 INFO L225 Difference]: With dead ends: 210 [2018-02-02 20:38:22,447 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 20:38:22,448 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1618 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=637, Invalid=6169, Unknown=0, NotChecked=0, Total=6806 [2018-02-02 20:38:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 20:38:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-02-02 20:38:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 20:38:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 220 transitions. [2018-02-02 20:38:22,449 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 220 transitions. Word has length 95 [2018-02-02 20:38:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:22,450 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 220 transitions. [2018-02-02 20:38:22,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 20:38:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 220 transitions. [2018-02-02 20:38:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-02-02 20:38:22,450 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:22,450 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:22,450 INFO L371 AbstractCegarLoop]: === Iteration 54 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2115472731, now seen corresponding path program 1 times [2018-02-02 20:38:22,451 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:22,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:38:22,541 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:22,541 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:38:22,541 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:22,541 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:22,541 INFO L182 omatonBuilderFactory]: Interpolants [22656#(= |#valid| |old(#valid)|), 22657#(and (= 0 (select |old(#valid)| |ldv_zalloc_#t~malloc3.base|)) (not (= |ldv_zalloc_#t~malloc3.base| 0)) (= (store |old(#valid)| |ldv_zalloc_#t~malloc3.base| (select |#valid| |ldv_zalloc_#t~malloc3.base|)) |#valid|)), 22658#(and (or (= |ldv_zalloc_#res.base| (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= 0 (select |old(#valid)| |ldv_zalloc_#res.base|)) (not (= |ldv_zalloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 22659#(and (not (= |ldv_arvo_init_specials_#t~ret17.base| 0)) (= 0 (select |old(#valid)| |ldv_arvo_init_specials_#t~ret17.base|)) (or (= |ldv_arvo_init_specials_#t~ret17.base| (@diff |old(#valid)| |#valid|)) (= |#valid| |old(#valid)|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 22660#(and (= 0 (select |old(#valid)| ldv_arvo_init_specials_~arvo~0.base)) (or (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~arvo~0.base (@diff |old(#valid)| |#valid|))) (not (= ldv_arvo_init_specials_~arvo~0.base 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 22653#true, 22654#false, 22655#(= 1 (select |#valid| entry_point_~intf~2.base))] [2018-02-02 20:38:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-02-02 20:38:22,542 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 20:38:22,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 20:38:22,542 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 20:38:22,542 INFO L87 Difference]: Start difference. First operand 210 states and 220 transitions. Second operand 8 states. [2018-02-02 20:38:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:22,842 INFO L93 Difference]: Finished difference Result 211 states and 221 transitions. [2018-02-02 20:38:22,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 20:38:22,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-02-02 20:38:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:22,843 INFO L225 Difference]: With dead ends: 211 [2018-02-02 20:38:22,843 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:38:22,843 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 20:38:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:38:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2018-02-02 20:38:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 20:38:22,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 213 transitions. [2018-02-02 20:38:22,845 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 213 transitions. Word has length 93 [2018-02-02 20:38:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:22,845 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 213 transitions. [2018-02-02 20:38:22,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 20:38:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 213 transitions. [2018-02-02 20:38:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:38:22,845 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:22,846 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:22,846 INFO L371 AbstractCegarLoop]: === Iteration 55 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1155145296, now seen corresponding path program 1 times [2018-02-02 20:38:22,846 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:22,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:23,489 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:23,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-02 20:38:23,489 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:23,489 INFO L182 omatonBuilderFactory]: Interpolants [23104#(and (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= ldv_arvo_init_specials_~arvo~0.base (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ldv_arvo_init_specials_~arvo~0.base 0))), 23105#(and (= |ldv_arvo_init_arvo_device_struct_#in~arvo.base| ldv_arvo_init_arvo_device_struct_~arvo.base) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23106#(and (= |ldv_arvo_init_arvo_device_struct_#in~arvo.base| ldv_arvo_init_arvo_device_struct_~arvo.base) (= (store |old(#memory_$Pointer$.offset)| ldv_arvo_init_arvo_device_struct_~arvo.base (select |#memory_$Pointer$.offset| ldv_arvo_init_arvo_device_struct_~arvo.base)) |#memory_$Pointer$.offset|)), 23107#(and (or (= |ldv_arvo_init_arvo_device_struct_#in~arvo.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 23108#(and (or (and (= ldv_arvo_init_specials_~arvo~0.base (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (not (= 0 ldv_arvo_init_specials_~arvo~0.base))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 23109#(and (or (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (= 0 (select |#valid| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)))) (= (store (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (or (= 0 (select |#valid| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 23110#(or (= 0 (select |#valid| entry_point_~intf~2.base)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))), 23111#(= |entry_point_#t~mem34.offset| 0), 23081#true, 23082#false, 23083#(= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1), 23084#(= (select |#valid| |ldv_malloc_#res.base|) 1), 23085#(= (select |#valid| |entry_point_#t~ret24.base|) 1), 23086#(= (select |#valid| entry_point_~hdev~0.base) 1), 23087#(= |#valid| |old(#valid)|), 23088#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 23089#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 23090#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|))), 23091#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 23092#(and (= 0 |ldv_malloc_#t~malloc2.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 23093#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|))), 23094#(and (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 0 |entry_point_#t~ret26.offset|) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 23095#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 23096#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= 0 (select (select |#memory_$Pointer$.offset| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 23097#(and (= 0 (select (select (store |#memory_$Pointer$.offset| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.offset| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) (+ entry_point_~intf~2.offset 8))) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 23098#(= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|), 23099#(and (not (= |ldv_zalloc_#t~malloc3.base| 0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)), 23100#(= |#memory_$Pointer$.offset| (store |old(#memory_$Pointer$.offset)| |#Ultimate.meminit_#ptr.base| (select |#memory_$Pointer$.offset| |#Ultimate.meminit_#ptr.base|))), 23101#(and (or (= |ldv_zalloc_#t~malloc3.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= |ldv_zalloc_#t~malloc3.base| 0)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|)), 23102#(and (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|) (not (= |ldv_zalloc_#res.base| 0)) (or (= |ldv_zalloc_#res.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))), 23103#(and (not (= |ldv_arvo_init_specials_#t~ret17.base| 0)) (or (= |ldv_arvo_init_specials_#t~ret17.base| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (= (store |old(#memory_$Pointer$.offset)| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|) (select |#memory_$Pointer$.offset| (@diff |old(#memory_$Pointer$.offset)| |#memory_$Pointer$.offset|))) |#memory_$Pointer$.offset|))] [2018-02-02 20:38:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:23,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-02 20:38:23,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-02 20:38:23,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2018-02-02 20:38:23,490 INFO L87 Difference]: Start difference. First operand 205 states and 213 transitions. Second operand 31 states. [2018-02-02 20:38:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:24,798 INFO L93 Difference]: Finished difference Result 220 states and 230 transitions. [2018-02-02 20:38:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 20:38:24,798 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 94 [2018-02-02 20:38:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:24,799 INFO L225 Difference]: With dead ends: 220 [2018-02-02 20:38:24,799 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 20:38:24,799 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=2223, Unknown=0, NotChecked=0, Total=2450 [2018-02-02 20:38:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 20:38:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 212. [2018-02-02 20:38:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 20:38:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 223 transitions. [2018-02-02 20:38:24,801 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 223 transitions. Word has length 94 [2018-02-02 20:38:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:24,801 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 223 transitions. [2018-02-02 20:38:24,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-02-02 20:38:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 223 transitions. [2018-02-02 20:38:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-02-02 20:38:24,802 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:24,802 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:24,802 INFO L371 AbstractCegarLoop]: === Iteration 56 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1155145297, now seen corresponding path program 1 times [2018-02-02 20:38:24,803 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:24,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:24,952 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:24,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 20:38:24,952 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:24,953 INFO L182 omatonBuilderFactory]: Interpolants [23584#false, 23585#(and (or (and (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|) 4294967296)) (< (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647) ldv_zalloc_~size)) (and (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|))))) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 23586#(= |#Ultimate.meminit_#t~loopctr35| 0), 23587#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| |#Ultimate.meminit_#sizeOfFields|)), 23588#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#product| |#Ultimate.meminit_#sizeOfFields|)), 23589#(and (<= (select |#length| |ldv_zalloc_#t~malloc3.base|) 1) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 23590#(and (= 0 |ldv_zalloc_#res.offset|) (<= (select |#length| |ldv_zalloc_#res.base|) 1)), 23591#(and (= 0 |ldv_arvo_init_specials_#t~ret17.offset|) (<= (select |#length| |ldv_arvo_init_specials_#t~ret17.base|) 1)), 23592#(and (<= (select |#length| ldv_arvo_init_specials_~arvo~0.base) 1) (= 0 ldv_arvo_init_specials_~arvo~0.offset)), 23593#(and (= ldv_arvo_init_arvo_device_struct_~arvo.base |ldv_arvo_init_arvo_device_struct_#in~arvo.base|) (or (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| ldv_arvo_init_arvo_device_struct_~arvo.offset) (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0))), 23594#(or (<= 12 (select |#length| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|)) (not (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| 0))), 23583#true] [2018-02-02 20:38:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:24,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:38:24,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:38:24,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:38:24,954 INFO L87 Difference]: Start difference. First operand 212 states and 223 transitions. Second operand 12 states. [2018-02-02 20:38:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:25,140 INFO L93 Difference]: Finished difference Result 221 states and 233 transitions. [2018-02-02 20:38:25,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:38:25,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-02-02 20:38:25,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:25,140 INFO L225 Difference]: With dead ends: 221 [2018-02-02 20:38:25,140 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 20:38:25,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:38:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 20:38:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-02-02 20:38:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 20:38:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 224 transitions. [2018-02-02 20:38:25,142 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 224 transitions. Word has length 94 [2018-02-02 20:38:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:25,143 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 224 transitions. [2018-02-02 20:38:25,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:38:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 224 transitions. [2018-02-02 20:38:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 20:38:25,143 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:25,144 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:25,144 INFO L371 AbstractCegarLoop]: === Iteration 57 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash -975286335, now seen corresponding path program 1 times [2018-02-02 20:38:25,144 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:25,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:25,583 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:25,583 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-02-02 20:38:25,583 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:25,584 INFO L182 omatonBuilderFactory]: Interpolants [24064#(= 1 (select |#valid| entry_point_~intf~2.base)), 24037#true, 24038#false, 24039#(= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)), 24040#(= 1 (select |#valid| |ldv_malloc_#res.base|)), 24041#(= 1 (select |#valid| |entry_point_#t~ret24.base|)), 24042#(= 1 (select |#valid| entry_point_~hdev~0.base)), 24043#(= |#valid| |old(#valid)|), 24044#(and (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 24045#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 1 (select |#valid| |ldv_malloc_#res.base|))), 24046#(and (= 1 (select |#valid| |entry_point_#t~ret25.base|)) (not (= |entry_point_#t~ret25.base| entry_point_~hdev~0.base))), 24047#(and (= 1 (select |#valid| entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 24048#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0)), 24049#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (not (= |ldv_malloc_#res.base| 0))), 24050#(and (not (= |entry_point_#t~ret26.base| entry_point_~intf~2.base)) (not (= |entry_point_#t~ret26.base| 0)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 24051#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 24052#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 24053#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 24054#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24055#(and (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24056#(and (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 24057#(and (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24058#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 24059#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|))), 24060#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 24061#(and (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 24062#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 24063#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem34.base|)) (= 1 (select |#valid| entry_point_~intf~2.base)))] [2018-02-02 20:38:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:25,584 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 20:38:25,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 20:38:25,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2018-02-02 20:38:25,584 INFO L87 Difference]: Start difference. First operand 213 states and 224 transitions. Second operand 28 states. [2018-02-02 20:38:26,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:26,475 INFO L93 Difference]: Finished difference Result 219 states and 230 transitions. [2018-02-02 20:38:26,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 20:38:26,475 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 97 [2018-02-02 20:38:26,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:26,476 INFO L225 Difference]: With dead ends: 219 [2018-02-02 20:38:26,476 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 20:38:26,476 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=2081, Unknown=0, NotChecked=0, Total=2352 [2018-02-02 20:38:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 20:38:26,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-02-02 20:38:26,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 20:38:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 226 transitions. [2018-02-02 20:38:26,477 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 226 transitions. Word has length 97 [2018-02-02 20:38:26,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:26,478 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 226 transitions. [2018-02-02 20:38:26,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 20:38:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 226 transitions. [2018-02-02 20:38:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-02-02 20:38:26,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:26,478 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-02-02 20:38:26,479 INFO L371 AbstractCegarLoop]: === Iteration 58 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:26,479 INFO L82 PathProgramCache]: Analyzing trace with hash 457605098, now seen corresponding path program 2 times [2018-02-02 20:38:26,479 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:26,489 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:38:27,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:27,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-02-02 20:38:27,204 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-02-02 20:38:27,205 INFO L182 omatonBuilderFactory]: Interpolants [24542#true, 24543#false, 24544#(= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1), 24545#(= (select |#valid| |ldv_malloc_#res.base|) 1), 24546#(= (select |#valid| |entry_point_#t~ret24.base|) 1), 24547#(= (select |#valid| entry_point_~hdev~0.base) 1), 24548#(= |#valid| |old(#valid)|), 24549#(and (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 24550#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1)), 24551#(and (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|))), 24552#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 24553#(and (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= (select |#valid| |entry_point_#t~ret26.base|) 1) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|))), 24554#(and (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 24555#(and (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 24556#(and (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 24557#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24558#(and (= 0 (select |old(#valid)| |ldv_zalloc_#t~malloc3.base|)) (not (= |ldv_zalloc_#t~malloc3.base| 0)) (= (store |old(#valid)| |ldv_zalloc_#t~malloc3.base| (select |#valid| |ldv_zalloc_#t~malloc3.base|)) |#valid|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24559#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 24560#(= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |#Ultimate.meminit_#ptr.base| (select |#memory_$Pointer$.base| |#Ultimate.meminit_#ptr.base|))), 24561#(and (= 0 (select |old(#valid)| |ldv_zalloc_#t~malloc3.base|)) (not (= |ldv_zalloc_#t~malloc3.base| 0)) (or (= |ldv_zalloc_#t~malloc3.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= (store |old(#valid)| |ldv_zalloc_#t~malloc3.base| (select |#valid| |ldv_zalloc_#t~malloc3.base|)) |#valid|)), 24562#(and (= 0 (select |old(#valid)| |ldv_zalloc_#res.base|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_zalloc_#res.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (not (= |ldv_zalloc_#res.base| 0)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24563#(and (not (= |ldv_arvo_init_specials_#t~ret17.base| 0)) (= 0 (select |old(#valid)| |ldv_arvo_init_specials_#t~ret17.base|)) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_init_specials_#t~ret17.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24564#(and (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_arvo_init_specials_~arvo~0.base (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= 0 (select |old(#valid)| ldv_arvo_init_specials_~arvo~0.base)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= ldv_arvo_init_specials_~arvo~0.base 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 24565#(and (= |ldv_arvo_init_arvo_device_struct_#in~arvo.base| ldv_arvo_init_arvo_device_struct_~arvo.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 24566#(and (= |ldv_arvo_init_arvo_device_struct_#in~arvo.base| ldv_arvo_init_arvo_device_struct_~arvo.base) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| ldv_arvo_init_arvo_device_struct_~arvo.base (select |#memory_$Pointer$.base| ldv_arvo_init_arvo_device_struct_~arvo.base)))), 24567#(and (or (= |ldv_arvo_init_arvo_device_struct_#in~arvo.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))))), 24568#(and (= |#memory_$Pointer$.base| (store (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= 0 (select |#valid| (@diff (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) |#memory_$Pointer$.base|)))) (or (= 0 (select |#valid| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))), 24569#(or (= 0 (select |#valid| entry_point_~intf~2.base)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))), 24570#(= 1 (select |#valid| |entry_point_#t~mem34.base|))] [2018-02-02 20:38:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-02-02 20:38:27,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-02 20:38:27,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-02 20:38:27,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2018-02-02 20:38:27,205 INFO L87 Difference]: Start difference. First operand 215 states and 226 transitions. Second operand 29 states. [2018-02-02 20:38:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:29,148 INFO L93 Difference]: Finished difference Result 215 states and 225 transitions. [2018-02-02 20:38:29,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-02-02 20:38:29,149 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 95 [2018-02-02 20:38:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:29,149 INFO L225 Difference]: With dead ends: 215 [2018-02-02 20:38:29,149 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 20:38:29,149 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=217, Invalid=1945, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 20:38:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 20:38:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-02 20:38:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 20:38:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 225 transitions. [2018-02-02 20:38:29,151 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 225 transitions. Word has length 95 [2018-02-02 20:38:29,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:29,151 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 225 transitions. [2018-02-02 20:38:29,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-02 20:38:29,152 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 225 transitions. [2018-02-02 20:38:29,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 20:38:29,152 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:29,152 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-02-02 20:38:29,152 INFO L371 AbstractCegarLoop]: === Iteration 59 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1913228832, now seen corresponding path program 1 times [2018-02-02 20:38:29,153 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:29,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:38:29,184 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:29,184 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 20:38:29,184 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:29,184 INFO L182 omatonBuilderFactory]: Interpolants [25040#(not (= 0 |ldv_arvo_init_specials_#res|)), 25041#(not (= 0 |ldv_arvo_probe_#t~ret23|)), 25042#(not (= 0 ldv_arvo_probe_~retval~1)), 25037#true, 25038#false, 25039#(not (= 0 ldv_arvo_init_specials_~retval~0))] [2018-02-02 20:38:29,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:38:29,185 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 20:38:29,185 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 20:38:29,185 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 20:38:29,185 INFO L87 Difference]: Start difference. First operand 215 states and 225 transitions. Second operand 6 states. [2018-02-02 20:38:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:29,199 INFO L93 Difference]: Finished difference Result 211 states and 220 transitions. [2018-02-02 20:38:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 20:38:29,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2018-02-02 20:38:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:29,199 INFO L225 Difference]: With dead ends: 211 [2018-02-02 20:38:29,200 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:38:29,200 INFO L554 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-02-02 20:38:29,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:38:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-02-02 20:38:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 20:38:29,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 220 transitions. [2018-02-02 20:38:29,201 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 220 transitions. Word has length 97 [2018-02-02 20:38:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:29,201 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 220 transitions. [2018-02-02 20:38:29,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 20:38:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 220 transitions. [2018-02-02 20:38:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 20:38:29,202 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:29,202 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:29,202 INFO L371 AbstractCegarLoop]: === Iteration 60 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash -169105259, now seen corresponding path program 1 times [2018-02-02 20:38:29,203 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:29,212 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:30,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:30,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 20:38:30,269 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:30,269 INFO L182 omatonBuilderFactory]: Interpolants [25472#(and (not (= entry_point_~hdev~0.base 0)) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| entry_point_~hdev~0.base))), 25473#(= |#valid| |old(#valid)|), 25474#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |#valid| |ldv_malloc_#t~malloc2.base|) 1) (= 0 |ldv_malloc_#t~malloc2.offset|) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|))) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 25475#(and (= 0 |ldv_malloc_#res.offset|) (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 25476#(and (not (= |entry_point_#t~ret25.base| 0)) (= (select |#valid| |entry_point_#t~ret25.base|) 1) (not (= entry_point_~hdev~0.base 0)) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset) (= 1 (select |#valid| entry_point_~hdev~0.base))), 25477#(and (= (select |#valid| entry_point_~intf~2.base) 1) (not (= entry_point_~hdev~0.base 0)) (not (= entry_point_~intf~2.base 0)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 25478#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 (select |old(#valid)| |ldv_malloc_#t~malloc2.base|))), 25479#(and (= 0 (select |old(#valid)| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0))), 25480#(and (not (= entry_point_~hdev~0.base |entry_point_#t~ret26.base|)) (not (= entry_point_~hdev~0.base 0)) (not (= |entry_point_#t~ret26.base| 0)) (not (= 0 entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~intf~2.base |entry_point_#t~ret26.base|)) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 25481#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base 0)) (not (= 0 entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 25482#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base 0)) (not (= 0 entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 25483#(and (not (= (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base 0)) (not (= entry_point_~hdev~0.base (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 25484#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 25485#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset)), 25486#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 25487#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |ldv_hid_set_drvdata_#in~data.base| ldv_hid_set_drvdata_~data.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 25488#(and (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (or (not (= ldv_dev_set_drvdata_~dev.offset 0)) (= |ldv_dev_set_drvdata_#in~data.base| ldv_dev_set_drvdata_~data.base)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 25489#(and (or (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (= |ldv_dev_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4)))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 25490#(and (or (= |ldv_hid_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|))), 25491#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4))) (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))), 25492#(and (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4))))), 25493#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 25494#(and (= |ldv_arvo_remove_#in~hdev.offset| ldv_arvo_remove_~hdev.offset) (= |ldv_arvo_remove_#in~hdev.base| ldv_arvo_remove_~hdev.base)), 25495#(and (= |lvd_arvo_remove_specials_#in~hdev.offset| lvd_arvo_remove_specials_~hdev.offset) (= lvd_arvo_remove_specials_~hdev.base |lvd_arvo_remove_specials_#in~hdev.base|)), 25496#(and (= |lvd_arvo_remove_specials_#in~hdev.offset| lvd_arvo_remove_specials_~hdev.offset) (= lvd_arvo_remove_specials_~hdev.base |lvd_arvo_remove_specials_#in~hdev.base|) (= 1 (select |#valid| lvd_arvo_remove_specials_~hdev.base))), 25497#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 25498#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0)))), 25499#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#t~mem4.base|)), 25500#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#res.base|)), 25501#(or (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#t~ret6.base|)), 25502#(or (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#res.base|) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 25503#(or (and (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) |lvd_arvo_remove_specials_#t~ret22.base|) (= 1 (select |#valid| |lvd_arvo_remove_specials_#in~hdev.base|))) (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0))), 25504#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (= 1 (select (store |#valid| lvd_arvo_remove_specials_~arvo~1.base 0) |lvd_arvo_remove_specials_#in~hdev.base|)) (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) |lvd_arvo_remove_specials_#in~hdev.base|)), 25505#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) |lvd_arvo_remove_specials_#in~hdev.base|) (= 1 (select |#valid| |lvd_arvo_remove_specials_#in~hdev.base|))), 25506#(or (= 1 (select |#valid| |ldv_arvo_remove_#in~hdev.base|)) (= (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ (- 0) 4)) |ldv_arvo_remove_#in~hdev.base|) (not (= |ldv_arvo_remove_#in~hdev.offset| 0))), 25507#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base)) (= 1 (select |#valid| entry_point_~hdev~0.base))), 25508#(and (= 1 (select (store |#valid| |entry_point_#t~mem34.base| 0) entry_point_~hdev~0.base)) (not (= |entry_point_#t~mem34.base| 0)) (not (= 0 entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base))), 25509#(and (= 1 (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~hdev~0.base)) (not (= 0 entry_point_~intf~2.base))), 25510#(= 1 (select |#valid| entry_point_~hdev~0.base)), 25467#true, 25468#false, 25469#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|))), 25470#(and (= 0 |ldv_malloc_#res.offset|) (= (select |#valid| |ldv_malloc_#res.base|) 1) (not (= |ldv_malloc_#res.base| 0))), 25471#(and (= 0 |entry_point_#t~ret24.offset|) (not (= |entry_point_#t~ret24.base| 0)) (= 1 (select |#valid| |entry_point_#t~ret24.base|)))] [2018-02-02 20:38:30,270 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 20:38:30,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 20:38:30,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 20:38:30,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1782, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:38:30,270 INFO L87 Difference]: Start difference. First operand 211 states and 220 transitions. Second operand 44 states. [2018-02-02 20:38:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:33,115 INFO L93 Difference]: Finished difference Result 214 states and 223 transitions. [2018-02-02 20:38:33,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:38:33,115 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 98 [2018-02-02 20:38:33,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:33,116 INFO L225 Difference]: With dead ends: 214 [2018-02-02 20:38:33,116 INFO L226 Difference]: Without dead ends: 214 [2018-02-02 20:38:33,116 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=427, Invalid=6713, Unknown=0, NotChecked=0, Total=7140 [2018-02-02 20:38:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-02-02 20:38:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-02-02 20:38:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 20:38:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 221 transitions. [2018-02-02 20:38:33,118 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 221 transitions. Word has length 98 [2018-02-02 20:38:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:33,118 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 221 transitions. [2018-02-02 20:38:33,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 20:38:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 221 transitions. [2018-02-02 20:38:33,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 20:38:33,118 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:33,118 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:33,119 INFO L371 AbstractCegarLoop]: === Iteration 61 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash 312784935, now seen corresponding path program 1 times [2018-02-02 20:38:33,119 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:33,125 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:38:33,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:33,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 20:38:33,187 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:33,187 INFO L182 omatonBuilderFactory]: Interpolants [26020#true, 26021#false, 26022#(<= (+ |ldv_nonpositive_#res| 1) 0), 26023#(<= (+ |ldv_arvo_init_arvo_device_struct_#t~ret13| 1) 0), 26024#(<= (+ |ldv_arvo_init_arvo_device_struct_#res| 1) 0), 26025#(<= (+ |ldv_arvo_init_specials_#t~ret18| 1) 0), 26026#(<= (+ ldv_arvo_init_specials_~retval~0 1) 0), 26027#(<= (+ |ldv_arvo_init_specials_#res| 1) 0), 26028#(<= (+ |ldv_arvo_probe_#t~ret23| 1) 0), 26029#(<= (+ ldv_arvo_probe_~retval~1 1) 0), 26030#(<= (+ |ldv_arvo_probe_#res| 1) 0), 26031#(<= (+ |entry_point_#t~ret33| 1) 0)] [2018-02-02 20:38:33,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:38:33,187 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 20:38:33,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 20:38:33,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 20:38:33,187 INFO L87 Difference]: Start difference. First operand 212 states and 221 transitions. Second operand 12 states. [2018-02-02 20:38:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:33,267 INFO L93 Difference]: Finished difference Result 223 states and 232 transitions. [2018-02-02 20:38:33,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 20:38:33,267 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2018-02-02 20:38:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:33,267 INFO L225 Difference]: With dead ends: 223 [2018-02-02 20:38:33,268 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 20:38:33,268 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:38:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 20:38:33,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-02 20:38:33,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 20:38:33,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 232 transitions. [2018-02-02 20:38:33,269 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 232 transitions. Word has length 98 [2018-02-02 20:38:33,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:33,270 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 232 transitions. [2018-02-02 20:38:33,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 20:38:33,270 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 232 transitions. [2018-02-02 20:38:33,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 20:38:33,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:33,270 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 20:38:33,270 INFO L371 AbstractCegarLoop]: === Iteration 62 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:33,270 INFO L82 PathProgramCache]: Analyzing trace with hash 245778182, now seen corresponding path program 1 times [2018-02-02 20:38:33,271 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:33,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:38:33,302 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 20:38:33,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 20:38:33,302 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:33,302 INFO L182 omatonBuilderFactory]: Interpolants [26482#true, 26483#false, 26484#(= 0 |ldv_nonpositive_#res|), 26485#(= 0 |ldv_arvo_init_arvo_device_struct_#t~ret13|), 26486#(= 0 |ldv_arvo_init_arvo_device_struct_#res|), 26487#(= 0 |ldv_arvo_init_specials_#t~ret18|), 26488#(= 0 ldv_arvo_init_specials_~retval~0)] [2018-02-02 20:38:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-02-02 20:38:33,302 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 20:38:33,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 20:38:33,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:33,303 INFO L87 Difference]: Start difference. First operand 223 states and 232 transitions. Second operand 7 states. [2018-02-02 20:38:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:33,313 INFO L93 Difference]: Finished difference Result 211 states and 216 transitions. [2018-02-02 20:38:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 20:38:33,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-02-02 20:38:33,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:33,313 INFO L225 Difference]: With dead ends: 211 [2018-02-02 20:38:33,314 INFO L226 Difference]: Without dead ends: 211 [2018-02-02 20:38:33,314 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 20:38:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-02-02 20:38:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-02-02 20:38:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-02-02 20:38:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 216 transitions. [2018-02-02 20:38:33,316 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 216 transitions. Word has length 98 [2018-02-02 20:38:33,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:33,316 INFO L432 AbstractCegarLoop]: Abstraction has 211 states and 216 transitions. [2018-02-02 20:38:33,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 20:38:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 216 transitions. [2018-02-02 20:38:33,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-02-02 20:38:33,317 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:33,317 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-02-02 20:38:33,317 INFO L371 AbstractCegarLoop]: === Iteration 63 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:33,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1671836524, now seen corresponding path program 1 times [2018-02-02 20:38:33,318 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:33,331 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:33,496 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:33,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 20:38:33,496 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:33,496 INFO L182 omatonBuilderFactory]: Interpolants [26912#false, 26913#(and (or (and (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|) 4294967296)) (< (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647) ldv_zalloc_~size)) (and (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|))))) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 26914#(= |#Ultimate.meminit_#t~loopctr35| 0), 26915#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| |#Ultimate.meminit_#sizeOfFields|)), 26916#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 2 |#Ultimate.meminit_#sizeOfFields|))), 26917#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#product| (* 2 |#Ultimate.meminit_#sizeOfFields|))), 26918#(and (= 0 |ldv_zalloc_#t~malloc3.offset|) (<= (select |#length| |ldv_zalloc_#t~malloc3.base|) 2)), 26919#(and (<= (select |#length| |ldv_zalloc_#res.base|) 2) (= 0 |ldv_zalloc_#res.offset|)), 26920#(and (= 0 |ldv_arvo_init_specials_#t~ret17.offset|) (<= (select |#length| |ldv_arvo_init_specials_#t~ret17.base|) 2)), 26921#(and (= 0 ldv_arvo_init_specials_~arvo~0.offset) (<= (select |#length| ldv_arvo_init_specials_~arvo~0.base) 2)), 26922#(and (= ldv_arvo_init_arvo_device_struct_~arvo.base |ldv_arvo_init_arvo_device_struct_#in~arvo.base|) (or (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| ldv_arvo_init_arvo_device_struct_~arvo.offset) (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0))), 26923#(or (<= 12 (select |#length| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|)) (not (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| 0))), 26911#true] [2018-02-02 20:38:33,496 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:33,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 20:38:33,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 20:38:33,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 20:38:33,497 INFO L87 Difference]: Start difference. First operand 211 states and 216 transitions. Second operand 13 states. [2018-02-02 20:38:33,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:33,796 INFO L93 Difference]: Finished difference Result 220 states and 226 transitions. [2018-02-02 20:38:33,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 20:38:33,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 97 [2018-02-02 20:38:33,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:33,797 INFO L225 Difference]: With dead ends: 220 [2018-02-02 20:38:33,797 INFO L226 Difference]: Without dead ends: 212 [2018-02-02 20:38:33,797 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-02-02 20:38:33,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-02-02 20:38:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-02-02 20:38:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 20:38:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 217 transitions. [2018-02-02 20:38:33,799 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 217 transitions. Word has length 97 [2018-02-02 20:38:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:33,799 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 217 transitions. [2018-02-02 20:38:33,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 20:38:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 217 transitions. [2018-02-02 20:38:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-02-02 20:38:33,800 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:33,800 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:33,800 INFO L371 AbstractCegarLoop]: === Iteration 64 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash 303546163, now seen corresponding path program 2 times [2018-02-02 20:38:33,800 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:33,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:33,941 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:33,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 20:38:33,942 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:33,942 INFO L182 omatonBuilderFactory]: Interpolants [27364#true, 27365#false, 27366#(and (or (and (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|) 4294967296)) (< (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647) ldv_zalloc_~size)) (and (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|))))) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 27367#(= |#Ultimate.meminit_#t~loopctr35| 0), 27368#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| |#Ultimate.meminit_#sizeOfFields|)), 27369#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 2 |#Ultimate.meminit_#sizeOfFields|))), 27370#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 3 |#Ultimate.meminit_#sizeOfFields|))), 27371#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#product| (* 3 |#Ultimate.meminit_#sizeOfFields|))), 27372#(and (<= (select |#length| |ldv_zalloc_#t~malloc3.base|) 3) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 27373#(and (<= (select |#length| |ldv_zalloc_#res.base|) 3) (= 0 |ldv_zalloc_#res.offset|)), 27374#(and (<= (select |#length| |ldv_arvo_init_specials_#t~ret17.base|) 3) (= 0 |ldv_arvo_init_specials_#t~ret17.offset|)), 27375#(and (<= (select |#length| ldv_arvo_init_specials_~arvo~0.base) 3) (= 0 ldv_arvo_init_specials_~arvo~0.offset)), 27376#(and (or (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| ldv_arvo_init_arvo_device_struct_~arvo.offset) (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0)) (or (= ldv_arvo_init_arvo_device_struct_~arvo.base |ldv_arvo_init_arvo_device_struct_#in~arvo.base|) (not (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0)))), 27377#(or (<= 12 (select |#length| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|)) (not (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| 0)))] [2018-02-02 20:38:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:33,942 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 20:38:33,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 20:38:33,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-02-02 20:38:33,942 INFO L87 Difference]: Start difference. First operand 212 states and 217 transitions. Second operand 14 states. [2018-02-02 20:38:34,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:34,126 INFO L93 Difference]: Finished difference Result 221 states and 227 transitions. [2018-02-02 20:38:34,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 20:38:34,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2018-02-02 20:38:34,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:34,127 INFO L225 Difference]: With dead ends: 221 [2018-02-02 20:38:34,127 INFO L226 Difference]: Without dead ends: 213 [2018-02-02 20:38:34,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2018-02-02 20:38:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-02-02 20:38:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-02-02 20:38:34,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-02-02 20:38:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 218 transitions. [2018-02-02 20:38:34,139 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 218 transitions. Word has length 98 [2018-02-02 20:38:34,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:34,140 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 218 transitions. [2018-02-02 20:38:34,140 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 20:38:34,140 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 218 transitions. [2018-02-02 20:38:34,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:38:34,140 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:34,140 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:34,141 INFO L371 AbstractCegarLoop]: === Iteration 65 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash 181927512, now seen corresponding path program 1 times [2018-02-02 20:38:34,141 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:34,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:38:36,588 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:36,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-02-02 20:38:36,588 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:38:36,589 INFO L182 omatonBuilderFactory]: Interpolants [27840#(= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|), 27841#(and (= |ldv_hid_set_drvdata_#in~hdev.offset| ldv_hid_set_drvdata_~hdev.offset) (= |ldv_hid_set_drvdata_#in~data.base| ldv_hid_set_drvdata_~data.base) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= ldv_hid_set_drvdata_~hdev.base |ldv_hid_set_drvdata_#in~hdev.base|)), 27842#(and (= |ldv_dev_set_drvdata_#in~data.base| ldv_dev_set_drvdata_~data.base) (or (= ldv_dev_set_drvdata_~dev.offset 0) (= |ldv_dev_set_drvdata_#in~dev.offset| ldv_dev_set_drvdata_~dev.offset)) (= ldv_dev_set_drvdata_~dev.base |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)), 27843#(or (not (= |ldv_dev_set_drvdata_#in~dev.offset| 0)) (and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_dev_set_drvdata_#in~dev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |ldv_dev_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_dev_set_drvdata_#in~dev.base|) (+ (- 0) 4))))), 27844#(or (not (= |ldv_hid_set_drvdata_#in~hdev.offset| 0)) (and (= |ldv_hid_set_drvdata_#in~data.base| (select (select |#memory_$Pointer$.base| |ldv_hid_set_drvdata_#in~hdev.base|) (+ (- 0) 4))) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_hid_set_drvdata_#in~hdev.base|)))), 27845#(or (not (= |ldv_arvo_init_specials_#in~hdev.offset| 0)) (and (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_init_specials_#in~hdev.base|) (+ (- 0) 4))) (<= 12 (select |old(#length)| |ldv_arvo_init_specials_#in~hdev.base|)) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)))), 27846#(or (not (= |ldv_arvo_probe_#in~hdev.offset| 0)) (and (<= 12 (select |old(#length)| |ldv_arvo_probe_#in~hdev.base|)) (= |#valid| |old(#valid)|) (or (= (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) |ldv_arvo_probe_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (= 0 (select (select |#memory_$Pointer$.base| |ldv_arvo_probe_#in~hdev.base|) (+ (- 0) 4))))), 27847#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 0) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (not (= 0 entry_point_~intf~2.base)) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base))) (= entry_point_~intf~2.offset 0) (= 0 (select (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~intf~2.offset 4))) (= 0 entry_point_~hdev~0.offset) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 27848#(and (= |#valid| |old(#valid)|) (= |ldv_arvo_remove_#in~hdev.offset| ldv_arvo_remove_~hdev.offset) (= |ldv_arvo_remove_#in~hdev.base| ldv_arvo_remove_~hdev.base)), 27849#(and (= |lvd_arvo_remove_specials_#in~hdev.offset| lvd_arvo_remove_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= |lvd_arvo_remove_specials_#in~hdev.base| lvd_arvo_remove_specials_~hdev.base)), 27850#(and (= |ldv_hid_get_drvdata_#in~hdev.offset| ldv_hid_get_drvdata_~hdev.offset) (= |ldv_hid_get_drvdata_#in~hdev.base| ldv_hid_get_drvdata_~hdev.base)), 27851#(and (or (= |ldv_dev_get_drvdata_#in~dev.offset| ldv_dev_get_drvdata_~dev.offset) (= ldv_dev_get_drvdata_~dev.offset 0)) (or (= ldv_dev_get_drvdata_~dev.base |ldv_dev_get_drvdata_#in~dev.base|) (not (= ldv_dev_get_drvdata_~dev.offset 0)))), 27852#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#t~mem4.base|)), 27853#(or (not (= |ldv_dev_get_drvdata_#in~dev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_dev_get_drvdata_#in~dev.base|) (+ (- 0) 4)) |ldv_dev_get_drvdata_#res.base|)), 27854#(or (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0)) (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#t~ret6.base|)), 27855#(or (= (select (select |#memory_$Pointer$.base| |ldv_hid_get_drvdata_#in~hdev.base|) (+ (- 0) 4)) |ldv_hid_get_drvdata_#res.base|) (not (= |ldv_hid_get_drvdata_#in~hdev.offset| 0))), 27856#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) |lvd_arvo_remove_specials_#t~ret22.base|) (= |#valid| |old(#valid)|))), 27857#(or (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (and (= |#valid| |old(#valid)|) (= lvd_arvo_remove_specials_~arvo~1.base (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4))))), 27858#(or (not (= (select (select |#memory_$Pointer$.base| |lvd_arvo_remove_specials_#in~hdev.base|) (+ (- 0) 4)) 0)) (not (= |lvd_arvo_remove_specials_#in~hdev.offset| 0)) (= |#valid| |old(#valid)|)), 27859#(or (not (= (select (select |#memory_$Pointer$.base| |ldv_arvo_remove_#in~hdev.base|) (+ (- 0) 4)) 0)) (= |#valid| |old(#valid)|) (not (= |ldv_arvo_remove_#in~hdev.offset| 0))), 27860#(and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 0) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= entry_point_~intf~2.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (not (= 0 entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base))) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 27861#(and (= (store |#valid| |entry_point_#t~mem34.base| 0) (store (store (store |old(#valid)| entry_point_~intf~2.base (select (store |#valid| |entry_point_#t~mem34.base| 0) entry_point_~intf~2.base)) |entry_point_#t~mem34.base| (select (store |#valid| |entry_point_#t~mem34.base| 0) |entry_point_#t~mem34.base|)) entry_point_~hdev~0.base (select (store |#valid| |entry_point_#t~mem34.base| 0) entry_point_~hdev~0.base))) (= (select |old(#valid)| |entry_point_#t~mem34.base|) (select (store |#valid| |entry_point_#t~mem34.base| 0) |entry_point_#t~mem34.base|)) (not (= |entry_point_#t~mem34.base| entry_point_~intf~2.base)) (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (not (= |entry_point_#t~mem34.base| 0)) (not (= 0 entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (not (= |entry_point_#t~mem34.base| entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 27862#(and (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~intf~2.base)) (not (= 0 entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base)) (= (store |#valid| entry_point_~intf~2.base 0) (store (store |old(#valid)| entry_point_~intf~2.base (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~intf~2.base)) entry_point_~hdev~0.base (select (store |#valid| entry_point_~intf~2.base 0) entry_point_~hdev~0.base)))), 27863#(and (not (= 0 entry_point_~hdev~0.base)) (or (and (= (select |old(#valid)| entry_point_~hdev~0.base) (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (= (select |old(#valid)| (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0))) (select (store |#valid| entry_point_~hdev~0.base 0) (@diff (store |old(#valid)| entry_point_~hdev~0.base (select (store |#valid| entry_point_~hdev~0.base 0) entry_point_~hdev~0.base)) (store |#valid| entry_point_~hdev~0.base 0))))) (not (= 1 (select |#valid| entry_point_~hdev~0.base))))), 27820#true, 27821#false, 27822#(= |#valid| |old(#valid)|), 27823#(and (not (= |ldv_malloc_#t~malloc2.base| 0)) (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (= 0 |ldv_malloc_#t~malloc2.offset|) (= 1 (select |#valid| |ldv_malloc_#t~malloc2.base|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))), 27824#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (= 0 |ldv_malloc_#res.offset|) (= 1 (select |#valid| |ldv_malloc_#res.base|)) (not (= |ldv_malloc_#res.base| 0)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 27825#(and (= (select |old(#valid)| |entry_point_#t~ret24.base|) 0) (= 0 |entry_point_#t~ret24.offset|) (not (= |entry_point_#t~ret24.base| 0)) (= 1 (select |#valid| |entry_point_#t~ret24.base|)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 27826#(and (not (= entry_point_~hdev~0.base 0)) (= 0 entry_point_~hdev~0.offset) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (= 1 (select |#valid| entry_point_~hdev~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))), 27827#(and (= |#valid| (store (store |old(#valid)| entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |entry_point_#t~ret25.base| (select |#valid| |entry_point_#t~ret25.base|))) (not (= |entry_point_#t~ret25.base| 0)) (= (select |old(#valid)| |entry_point_#t~ret25.base|) 0) (not (= 0 entry_point_~hdev~0.base)) (not (= entry_point_~hdev~0.base |entry_point_#t~ret25.base|)) (= 1 (select |#valid| |entry_point_#t~ret25.base|)) (= 0 |entry_point_#t~ret25.offset|) (= 0 entry_point_~hdev~0.offset) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)), 27828#(and (not (= 0 entry_point_~hdev~0.base)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= 1 (select |#valid| entry_point_~intf~2.base)) (not (= entry_point_~intf~2.base 0)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (= (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 27829#(and (or (< 0 (+ (div ldv_malloc_~size 4294967296) 1)) (<= |ldv_malloc_#in~size| ldv_malloc_~size)) (or (<= ldv_malloc_~size |ldv_malloc_#in~size|) (<= (+ (div ldv_malloc_~size 4294967296) 1) 0)) (= |#valid| |old(#valid)|)), 27830#(and (= (select |old(#valid)| |ldv_malloc_#t~malloc2.base|) 0) (or (and (not (= |ldv_malloc_#t~malloc2.base| 0)) (or (<= (select |#length| |ldv_malloc_#t~malloc2.base|) |ldv_malloc_#in~size|) (<= 2147483648 |ldv_malloc_#in~size|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#t~malloc2.base| (select |#valid| |ldv_malloc_#t~malloc2.base|)))) (<= (+ |ldv_malloc_#in~size| 1) 0))), 27831#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) 0) (or (<= (+ |ldv_malloc_#in~size| 1) 0) (and (or (<= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (<= 2147483648 |ldv_malloc_#in~size|)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| 0))))), 27832#(and (not (= |entry_point_#t~ret26.base| entry_point_~intf~2.base)) (not (= 0 entry_point_~hdev~0.base)) (or (and (<= (select |#length| |entry_point_#t~ret26.base|) 9) (= entry_point_~hdev~0.base |entry_point_#t~ret26.base|)) (and (= (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) |entry_point_#t~ret26.base| (select |#valid| |entry_point_#t~ret26.base|)) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base)) |#valid|) (not (= entry_point_~hdev~0.base |entry_point_#t~ret26.base|)) (= (select |old(#valid)| |entry_point_#t~ret26.base|) 0) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (not (= |entry_point_#t~ret26.base| 0)) (not (= 0 entry_point_~intf~2.base)) (= (select |old(#valid)| entry_point_~hdev~0.base) 0))) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 27833#(and (not (= 0 entry_point_~hdev~0.base)) (or (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 0) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (not (= 0 entry_point_~intf~2.base)) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base))) (= (select |old(#valid)| entry_point_~hdev~0.base) 0)) (and (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (<= (select |#length| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 9))) (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) entry_point_~intf~2.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 27834#(and (or (and (<= (select |#length| |entry_point_#t~mem29.base|) 9) (= |entry_point_#t~mem29.base| entry_point_~hdev~0.base)) (and (not (= (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 0) (not (= entry_point_~hdev~0.base (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (not (= 0 entry_point_~intf~2.base)) (= |entry_point_#t~mem29.base| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select |#valid| (select (select |#memory_$Pointer$.base| entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base))) (= (select |old(#valid)| entry_point_~hdev~0.base) 0))) (not (= 0 entry_point_~hdev~0.base)) (not (= entry_point_~intf~2.base |entry_point_#t~mem29.base|)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 27835#(and (or (and (not (= (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) 0)) (= (select |old(#valid)| entry_point_~intf~2.base) 0) (= (select |old(#valid)| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))) 0) (not (= entry_point_~hdev~0.base (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) (not (= 0 entry_point_~intf~2.base)) (= |#valid| (store (store (store |old(#valid)| entry_point_~intf~2.base (select |#valid| entry_point_~intf~2.base)) (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)) (select |#valid| (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4)))) entry_point_~hdev~0.base (select |#valid| entry_point_~hdev~0.base))) (= (select |old(#valid)| entry_point_~hdev~0.base) 0) (not (= entry_point_~intf~2.base (select (select (store |#memory_$Pointer$.base| entry_point_~hdev~0.base (store (select |#memory_$Pointer$.base| entry_point_~hdev~0.base) (+ entry_point_~hdev~0.offset 8) entry_point_~intf~2.base)) entry_point_~intf~2.base) (+ entry_point_~intf~2.offset 4))))) (<= (select |#length| entry_point_~hdev~0.base) 9)) (not (= 0 entry_point_~hdev~0.base)) (= entry_point_~intf~2.offset 0) (= 0 entry_point_~hdev~0.offset) (not (= entry_point_~hdev~0.base entry_point_~intf~2.base))), 27836#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|)), 27837#(and (= ldv_arvo_probe_~hdev.base |ldv_arvo_probe_#in~hdev.base|) (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |ldv_arvo_probe_#in~hdev.offset| ldv_arvo_probe_~hdev.offset) (= |old(#length)| |#length|)), 27838#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|)), 27839#(and (= |ldv_arvo_init_specials_#in~hdev.offset| ldv_arvo_init_specials_~hdev.offset) (= |#valid| |old(#valid)|) (= ldv_arvo_init_specials_~hdev.base |ldv_arvo_init_specials_#in~hdev.base|) (or (<= (+ ldv_arvo_init_specials_~hdev.offset 12) (select |#length| ldv_arvo_init_specials_~hdev.base)) (not (= ldv_arvo_init_specials_~hdev.offset 0))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|))] [2018-02-02 20:38:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-02-02 20:38:36,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-02-02 20:38:36,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-02-02 20:38:36,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1765, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 20:38:36,589 INFO L87 Difference]: Start difference. First operand 213 states and 218 transitions. Second operand 44 states. [2018-02-02 20:38:39,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:39,823 INFO L93 Difference]: Finished difference Result 216 states and 220 transitions. [2018-02-02 20:38:39,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-02-02 20:38:39,823 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2018-02-02 20:38:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:39,824 INFO L225 Difference]: With dead ends: 216 [2018-02-02 20:38:39,824 INFO L226 Difference]: Without dead ends: 164 [2018-02-02 20:38:39,824 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=411, Invalid=5595, Unknown=0, NotChecked=0, Total=6006 [2018-02-02 20:38:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-02-02 20:38:39,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-02-02 20:38:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-02-02 20:38:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2018-02-02 20:38:39,826 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 101 [2018-02-02 20:38:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:39,827 INFO L432 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2018-02-02 20:38:39,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-02-02 20:38:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-02-02 20:38:39,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-02-02 20:38:39,827 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:39,828 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:39,828 INFO L371 AbstractCegarLoop]: === Iteration 66 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:39,828 INFO L82 PathProgramCache]: Analyzing trace with hash 836217932, now seen corresponding path program 3 times [2018-02-02 20:38:39,828 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:39,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:40,043 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:40,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-02-02 20:38:40,043 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:40,044 INFO L182 omatonBuilderFactory]: Interpolants [28320#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#product| (* 4 |#Ultimate.meminit_#sizeOfFields|))), 28321#(and (= 0 |ldv_zalloc_#t~malloc3.offset|) (<= (select |#length| |ldv_zalloc_#t~malloc3.base|) 4)), 28322#(and (<= (select |#length| |ldv_zalloc_#res.base|) 4) (= 0 |ldv_zalloc_#res.offset|)), 28323#(and (<= (select |#length| |ldv_arvo_init_specials_#t~ret17.base|) 4) (= 0 |ldv_arvo_init_specials_#t~ret17.offset|)), 28324#(and (= 0 ldv_arvo_init_specials_~arvo~0.offset) (<= (select |#length| ldv_arvo_init_specials_~arvo~0.base) 4)), 28325#(and (= ldv_arvo_init_arvo_device_struct_~arvo.base |ldv_arvo_init_arvo_device_struct_#in~arvo.base|) (or (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| ldv_arvo_init_arvo_device_struct_~arvo.offset) (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0))), 28326#(or (<= 12 (select |#length| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|)) (not (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| 0))), 28312#true, 28313#false, 28314#(and (or (and (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|) 4294967296)) (< (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647) ldv_zalloc_~size)) (and (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|))))) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 28315#(= |#Ultimate.meminit_#t~loopctr35| 0), 28316#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| |#Ultimate.meminit_#sizeOfFields|)), 28317#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 2 |#Ultimate.meminit_#sizeOfFields|))), 28318#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 3 |#Ultimate.meminit_#sizeOfFields|))), 28319#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 4 |#Ultimate.meminit_#sizeOfFields|)))] [2018-02-02 20:38:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:40,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 20:38:40,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 20:38:40,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-02-02 20:38:40,045 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand 15 states. [2018-02-02 20:38:40,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:40,263 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2018-02-02 20:38:40,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 20:38:40,263 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 99 [2018-02-02 20:38:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:40,264 INFO L225 Difference]: With dead ends: 173 [2018-02-02 20:38:40,264 INFO L226 Difference]: Without dead ends: 165 [2018-02-02 20:38:40,264 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-02-02 20:38:40,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-02-02 20:38:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-02-02 20:38:40,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-02-02 20:38:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2018-02-02 20:38:40,265 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 99 [2018-02-02 20:38:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:40,265 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2018-02-02 20:38:40,266 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 20:38:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-02-02 20:38:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-02-02 20:38:40,266 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:40,266 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:40,266 INFO L371 AbstractCegarLoop]: === Iteration 67 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:40,266 INFO L82 PathProgramCache]: Analyzing trace with hash 169173587, now seen corresponding path program 4 times [2018-02-02 20:38:40,267 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:40,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 20:38:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:40,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 20:38:40,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-02-02 20:38:40,483 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 20:38:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:40,483 INFO L182 omatonBuilderFactory]: Interpolants [28673#true, 28674#false, 28675#(and (or (and (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|) 4294967296)) (< (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647) ldv_zalloc_~size)) (and (<= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) 2147483647)) (= ldv_zalloc_~size (+ (* 4294967296 (div ldv_zalloc_~size 4294967296)) (select |#length| |ldv_zalloc_#t~malloc3.base|))))) (= 0 |ldv_zalloc_#t~malloc3.offset|)), 28676#(= |#Ultimate.meminit_#t~loopctr35| 0), 28677#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| |#Ultimate.meminit_#sizeOfFields|)), 28678#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 2 |#Ultimate.meminit_#sizeOfFields|))), 28679#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 3 |#Ultimate.meminit_#sizeOfFields|))), 28680#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 4 |#Ultimate.meminit_#sizeOfFields|))), 28681#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#t~loopctr35| (* 5 |#Ultimate.meminit_#sizeOfFields|))), 28682#(or (not (= |#Ultimate.meminit_#sizeOfFields| 1)) (<= |#Ultimate.meminit_#product| (* 5 |#Ultimate.meminit_#sizeOfFields|))), 28683#(and (= 0 |ldv_zalloc_#t~malloc3.offset|) (<= (select |#length| |ldv_zalloc_#t~malloc3.base|) 5)), 28684#(and (<= (select |#length| |ldv_zalloc_#res.base|) 5) (= 0 |ldv_zalloc_#res.offset|)), 28685#(and (= 0 |ldv_arvo_init_specials_#t~ret17.offset|) (<= (select |#length| |ldv_arvo_init_specials_#t~ret17.base|) 5)), 28686#(and (<= (select |#length| ldv_arvo_init_specials_~arvo~0.base) 5) (= 0 ldv_arvo_init_specials_~arvo~0.offset)), 28687#(and (or (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| ldv_arvo_init_arvo_device_struct_~arvo.offset) (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0)) (or (= ldv_arvo_init_arvo_device_struct_~arvo.base |ldv_arvo_init_arvo_device_struct_#in~arvo.base|) (not (= ldv_arvo_init_arvo_device_struct_~arvo.offset 0)))), 28688#(or (<= 12 (select |#length| |ldv_arvo_init_arvo_device_struct_#in~arvo.base|)) (not (= |ldv_arvo_init_arvo_device_struct_#in~arvo.offset| 0)))] [2018-02-02 20:38:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-02-02 20:38:40,484 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 20:38:40,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 20:38:40,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-02-02 20:38:40,484 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 16 states. [2018-02-02 20:38:40,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 20:38:40,712 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2018-02-02 20:38:40,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 20:38:40,713 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 100 [2018-02-02 20:38:40,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 20:38:40,713 INFO L225 Difference]: With dead ends: 174 [2018-02-02 20:38:40,713 INFO L226 Difference]: Without dead ends: 166 [2018-02-02 20:38:40,713 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-02-02 20:38:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-02-02 20:38:40,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-02-02 20:38:40,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-02-02 20:38:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 170 transitions. [2018-02-02 20:38:40,715 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 170 transitions. Word has length 100 [2018-02-02 20:38:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 20:38:40,715 INFO L432 AbstractCegarLoop]: Abstraction has 166 states and 170 transitions. [2018-02-02 20:38:40,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 20:38:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 170 transitions. [2018-02-02 20:38:40,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-02-02 20:38:40,715 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 20:38:40,715 INFO L351 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-02 20:38:40,715 INFO L371 AbstractCegarLoop]: === Iteration 68 === [ldv_arvo_init_specialsErr1RequiresViolation, ldv_arvo_init_specialsErr3RequiresViolation, ldv_arvo_init_specialsErr7RequiresViolation, ldv_arvo_init_specialsErr2RequiresViolation, ldv_arvo_init_specialsErr4RequiresViolation, ldv_arvo_init_specialsErr0RequiresViolation, ldv_arvo_init_specialsErr6RequiresViolation, ldv_arvo_init_specialsErr5RequiresViolation, ldv_dev_set_drvdataErr0RequiresViolation, ldv_dev_set_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr1RequiresViolation, ldv_dev_get_drvdataErr0RequiresViolation, mainErr0EnsuresViolation, entry_pointErr5RequiresViolation, entry_pointErr14RequiresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation, entry_pointErr13RequiresViolation, entry_pointErr6RequiresViolation, entry_pointErr8RequiresViolation, entry_pointErr11RequiresViolation, entry_pointErr3RequiresViolation, entry_pointErr16RequiresViolation, entry_pointErr7RequiresViolation, entry_pointErr12RequiresViolation, entry_pointErr15RequiresViolation, entry_pointErr17RequiresViolation, entry_pointErr4RequiresViolation, entry_pointErr2RequiresViolation, entry_pointErr9RequiresViolation, entry_pointErr10RequiresViolation, ldv_arvo_init_arvo_device_structErr0RequiresViolation, ldv_arvo_init_arvo_device_structErr2RequiresViolation, ldv_arvo_init_arvo_device_structErr4RequiresViolation, ldv_arvo_init_arvo_device_structErr5RequiresViolation, ldv_arvo_init_arvo_device_structErr1RequiresViolation, ldv_arvo_init_arvo_device_structErr3RequiresViolation, lvd_arvo_remove_specialsErr4RequiresViolation, lvd_arvo_remove_specialsErr1RequiresViolation, lvd_arvo_remove_specialsErr0RequiresViolation, lvd_arvo_remove_specialsErr6RequiresViolation, lvd_arvo_remove_specialsErr7RequiresViolation, lvd_arvo_remove_specialsErr5RequiresViolation, lvd_arvo_remove_specialsErr2RequiresViolation, lvd_arvo_remove_specialsErr3RequiresViolation]=== [2018-02-02 20:38:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash 965635372, now seen corresponding path program 5 times [2018-02-02 20:38:40,716 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 20:38:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 20:38:40,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. Received shutdown request... [2018-02-02 20:38:40,813 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 20:38:40,816 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 20:38:40,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:38:40 BoogieIcfgContainer [2018-02-02 20:38:40,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 20:38:40,817 INFO L168 Benchmark]: Toolchain (without parser) took 66356.43 ms. Allocated memory was 394.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 351.5 MB in the beginning and 950.9 MB in the end (delta: -599.4 MB). Peak memory consumption was 454.4 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:40,817 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 394.8 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 20:38:40,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.41 ms. Allocated memory is still 394.8 MB. Free memory was 351.5 MB in the beginning and 336.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:40,818 INFO L168 Benchmark]: Boogie Preprocessor took 31.03 ms. Allocated memory is still 394.8 MB. Free memory was 336.8 MB in the beginning and 334.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:40,818 INFO L168 Benchmark]: RCFGBuilder took 392.70 ms. Allocated memory is still 394.8 MB. Free memory was 334.1 MB in the beginning and 290.4 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:40,818 INFO L168 Benchmark]: TraceAbstraction took 65738.56 ms. Allocated memory was 394.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 290.4 MB in the beginning and 950.9 MB in the end (delta: -660.5 MB). Peak memory consumption was 393.3 MB. Max. memory is 5.3 GB. [2018-02-02 20:38:40,819 INFO L344 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 394.8 MB. Free memory is still 358.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 191.41 ms. Allocated memory is still 394.8 MB. Free memory was 351.5 MB in the beginning and 336.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.03 ms. Allocated memory is still 394.8 MB. Free memory was 336.8 MB in the beginning and 334.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 392.70 ms. Allocated memory is still 394.8 MB. Free memory was 334.1 MB in the beginning and 290.4 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65738.56 ms. Allocated memory was 394.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 290.4 MB in the beginning and 950.9 MB in the end (delta: -660.5 MB). Peak memory consumption was 393.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1533]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1533). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was analyzing trace of length 102 with TraceHistMax 6, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 173 locations, 45 error locations. TIMEOUT Result, 65.7s OverallTime, 68 OverallIterations, 6 TraceHistogramMax, 42.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8883 SDtfs, 6881 SDslu, 60663 SDs, 0 SdLazy, 64000 SolverSat, 2654 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1818 GetRequests, 228 SyntacticMatches, 71 SemanticMatches, 1519 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10992 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 874/1127 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 67 MinimizatonAttempts, 616 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 21.4s InterpolantComputationTime, 4392 NumberOfCodeBlocks, 4392 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 4325 ConstructedInterpolants, 0 QuantifiedInterpolants, 3185174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 67 InterpolantComputations, 24 PerfectInterpolantSequences, 874/1127 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_20-38-40-824.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_20-38-40-824.csv Completed graceful shutdown