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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:21:18,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:21:18,539 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:21:18,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:21:18,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:21:18,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:21:18,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:21:18,559 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:21:18,561 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:21:18,561 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:21:18,562 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:21:18,563 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:21:18,564 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:21:18,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:21:18,566 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:21:18,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:21:18,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:21:18,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:21:18,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:21:18,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:21:18,577 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:21:18,577 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:21:18,578 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:21:18,579 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:21:18,580 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:21:18,581 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:21:18,581 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:21:18,582 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:21:18,582 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:21:18,582 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:21:18,583 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:21:18,583 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:21:18,593 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:21:18,594 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:21:18,594 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:21:18,595 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:21:18,595 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:21:18,595 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:21:18,595 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:21:18,595 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:21:18,596 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:21:18,596 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:21:18,596 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:21:18,596 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:21:18,596 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:21:18,596 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:21:18,596 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:21:18,596 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:21:18,597 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:21:18,597 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:21:18,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:21:18,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:21:18,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:21:18,597 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:21:18,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:21:18,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:21:18,598 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:21:18,598 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:21:18,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:21:18,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:21:18,598 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:21:18,599 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:21:18,599 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:21:18,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:21:18,600 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:21:18,600 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:21:18,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:21:18,645 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:21:18,648 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:21:18,649 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:21:18,650 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:21:18,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_false-valid-memtrack.i [2018-01-24 12:21:18,843 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:21:18,847 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:21:18,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:21:18,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:21:18,853 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:21:18,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:21:18" (1/1) ... [2018-01-24 12:21:18,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c105265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:18, skipping insertion in model container [2018-01-24 12:21:18,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:21:18" (1/1) ... [2018-01-24 12:21:18,871 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:21:18,920 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:21:19,046 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:21:19,077 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:21:19,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19 WrapperNode [2018-01-24 12:21:19,090 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:21:19,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:21:19,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:21:19,091 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:21:19,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19" (1/1) ... [2018-01-24 12:21:19,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19" (1/1) ... [2018-01-24 12:21:19,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19" (1/1) ... [2018-01-24 12:21:19,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19" (1/1) ... [2018-01-24 12:21:19,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19" (1/1) ... [2018-01-24 12:21:19,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19" (1/1) ... [2018-01-24 12:21:19,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19" (1/1) ... [2018-01-24 12:21:19,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:21:19,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:21:19,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:21:19,137 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:21:19,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19" (1/1) ... No working directory specified, using /storage/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-01-24 12:21:19,191 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:21:19,191 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:21:19,191 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-01-24 12:21:19,191 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-01-24 12:21:19,191 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-01-24 12:21:19,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-01-24 12:21:19,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-01-24 12:21:19,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-01-24 12:21:19,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-01-24 12:21:19,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials_unsafe [2018-01-24 12:21:19,192 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-01-24 12:21:19,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe_unsafe [2018-01-24 12:21:19,193 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-01-24 12:21:19,193 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 12:21:19,193 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:21:19,193 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:21:19,193 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:21:19,193 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:21:19,193 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:21:19,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:21:19,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:21:19,194 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:21:19,194 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-01-24 12:21:19,194 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-01-24 12:21:19,194 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-01-24 12:21:19,194 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:21:19,194 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:21:19,194 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-01-24 12:21:19,194 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials_unsafe [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe_unsafe [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 12:21:19,195 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:21:19,196 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:21:19,196 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:21:19,724 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:21:19,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:21:19 BoogieIcfgContainer [2018-01-24 12:21:19,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:21:19,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:21:19,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:21:19,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:21:19,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:21:18" (1/3) ... [2018-01-24 12:21:19,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11639732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:21:19, skipping insertion in model container [2018-01-24 12:21:19,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:21:19" (2/3) ... [2018-01-24 12:21:19,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11639732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:21:19, skipping insertion in model container [2018-01-24 12:21:19,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:21:19" (3/3) ... [2018-01-24 12:21:19,731 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test15_false-valid-memtrack.i [2018-01-24 12:21:19,737 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:21:19,744 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-01-24 12:21:19,789 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:21:19,789 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:21:19,789 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:21:19,789 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:21:19,790 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:21:19,790 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:21:19,790 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:21:19,790 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:21:19,791 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:21:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2018-01-24 12:21:19,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:21:19,817 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:19,818 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:19,819 INFO L371 AbstractCegarLoop]: === Iteration 1 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:19,824 INFO L82 PathProgramCache]: Analyzing trace with hash 462743197, now seen corresponding path program 1 times [2018-01-24 12:21:19,826 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:19,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:19,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:19,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:19,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:19,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:21:20,150 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:20,150 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:21:20,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:21:20,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:21:20,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:21:20,163 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 6 states. [2018-01-24 12:21:20,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:20,243 INFO L93 Difference]: Finished difference Result 172 states and 184 transitions. [2018-01-24 12:21:20,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:21:20,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 12:21:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:20,258 INFO L225 Difference]: With dead ends: 172 [2018-01-24 12:21:20,258 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 12:21:20,262 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:21:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 12:21:20,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-01-24 12:21:20,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 12:21:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 174 transitions. [2018-01-24 12:21:20,316 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 174 transitions. Word has length 22 [2018-01-24 12:21:20,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:20,318 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 174 transitions. [2018-01-24 12:21:20,318 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:21:20,319 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 174 transitions. [2018-01-24 12:21:20,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 12:21:20,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:20,321 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:20,321 INFO L371 AbstractCegarLoop]: === Iteration 2 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:20,321 INFO L82 PathProgramCache]: Analyzing trace with hash -844495449, now seen corresponding path program 1 times [2018-01-24 12:21:20,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:20,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:20,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:20,323 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:20,324 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:20,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:21:20,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:20,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:21:20,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:21:20,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:21:20,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:21:20,450 INFO L87 Difference]: Start difference. First operand 162 states and 174 transitions. Second operand 6 states. [2018-01-24 12:21:20,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:20,568 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2018-01-24 12:21:20,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:21:20,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2018-01-24 12:21:20,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:20,571 INFO L225 Difference]: With dead ends: 169 [2018-01-24 12:21:20,571 INFO L226 Difference]: Without dead ends: 162 [2018-01-24 12:21:20,572 INFO L525 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-01-24 12:21:20,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-01-24 12:21:20,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-01-24 12:21:20,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-01-24 12:21:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-01-24 12:21:20,590 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 33 [2018-01-24 12:21:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:20,590 INFO L432 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-01-24 12:21:20,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:21:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-01-24 12:21:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:21:20,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:20,592 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:20,592 INFO L371 AbstractCegarLoop]: === Iteration 3 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash 902320110, now seen corresponding path program 1 times [2018-01-24 12:21:20,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:20,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:20,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:20,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:20,595 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:20,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-24 12:21:20,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:20,858 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:20,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:20,931 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:20,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:21:20,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:20,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:21:20,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:21:21,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:21,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 12:21:21,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:21,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:21:21,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:21:21,110 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:21,120 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:21,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:21:21,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:21,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:21:21,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 12:21:21,210 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 12:21:21,231 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:21,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 11 [2018-01-24 12:21:21,232 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:21:21,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:21:21,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:21:21,233 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 12 states. [2018-01-24 12:21:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:22,168 INFO L93 Difference]: Finished difference Result 210 states and 228 transitions. [2018-01-24 12:21:22,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 12:21:22,169 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-01-24 12:21:22,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:22,173 INFO L225 Difference]: With dead ends: 210 [2018-01-24 12:21:22,173 INFO L226 Difference]: Without dead ends: 205 [2018-01-24 12:21:22,174 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:21:22,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-01-24 12:21:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 175. [2018-01-24 12:21:22,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-01-24 12:21:22,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 192 transitions. [2018-01-24 12:21:22,201 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 192 transitions. Word has length 44 [2018-01-24 12:21:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:22,202 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 192 transitions. [2018-01-24 12:21:22,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:21:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 192 transitions. [2018-01-24 12:21:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 12:21:22,204 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:22,204 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:22,204 INFO L371 AbstractCegarLoop]: === Iteration 4 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:22,204 INFO L82 PathProgramCache]: Analyzing trace with hash 902320111, now seen corresponding path program 1 times [2018-01-24 12:21:22,204 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:22,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:22,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:22,206 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:22,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:22,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:22,477 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-24 12:21:22,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:22,477 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:22,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:22,519 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:22,571 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-24 12:21:22,592 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:21:22,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2018-01-24 12:21:22,593 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:21:22,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:21:22,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:21:22,594 INFO L87 Difference]: Start difference. First operand 175 states and 192 transitions. Second operand 10 states. [2018-01-24 12:21:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:22,705 INFO L93 Difference]: Finished difference Result 349 states and 390 transitions. [2018-01-24 12:21:22,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:21:22,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-01-24 12:21:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:22,707 INFO L225 Difference]: With dead ends: 349 [2018-01-24 12:21:22,707 INFO L226 Difference]: Without dead ends: 176 [2018-01-24 12:21:22,708 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:21:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-01-24 12:21:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-01-24 12:21:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-01-24 12:21:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 193 transitions. [2018-01-24 12:21:22,728 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 193 transitions. Word has length 44 [2018-01-24 12:21:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:22,729 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 193 transitions. [2018-01-24 12:21:22,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:21:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2018-01-24 12:21:22,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:21:22,730 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:22,730 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:22,730 INFO L371 AbstractCegarLoop]: === Iteration 5 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash -506792821, now seen corresponding path program 1 times [2018-01-24 12:21:22,731 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:22,731 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:22,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:22,732 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:22,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:22,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-01-24 12:21:22,963 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:22,963 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:22,974 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:23,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 12:21:23,163 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:23,163 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-01-24 12:21:23,164 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 12:21:23,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 12:21:23,164 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:21:23,164 INFO L87 Difference]: Start difference. First operand 176 states and 193 transitions. Second operand 12 states. [2018-01-24 12:21:23,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:23,280 INFO L93 Difference]: Finished difference Result 351 states and 392 transitions. [2018-01-24 12:21:23,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:21:23,281 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2018-01-24 12:21:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:23,283 INFO L225 Difference]: With dead ends: 351 [2018-01-24 12:21:23,283 INFO L226 Difference]: Without dead ends: 177 [2018-01-24 12:21:23,285 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:21:23,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-01-24 12:21:23,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-01-24 12:21:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-24 12:21:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 194 transitions. [2018-01-24 12:21:23,301 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 194 transitions. Word has length 47 [2018-01-24 12:21:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:23,301 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 194 transitions. [2018-01-24 12:21:23,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 12:21:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 194 transitions. [2018-01-24 12:21:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-24 12:21:23,302 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:23,303 INFO L322 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:23,303 INFO L371 AbstractCegarLoop]: === Iteration 6 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:23,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1284083601, now seen corresponding path program 2 times [2018-01-24 12:21:23,303 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:23,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:23,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:23,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:23,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:23,337 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-24 12:21:23,639 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:23,639 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:23,646 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:21:23,671 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:23,688 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:23,694 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:23,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-01-24 12:21:23,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:23,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2018-01-24 12:21:23,849 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:21:23,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:21:23,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:21:23,849 INFO L87 Difference]: Start difference. First operand 177 states and 194 transitions. Second operand 14 states. [2018-01-24 12:21:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:24,067 INFO L93 Difference]: Finished difference Result 353 states and 394 transitions. [2018-01-24 12:21:24,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:21:24,068 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-01-24 12:21:24,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:24,069 INFO L225 Difference]: With dead ends: 353 [2018-01-24 12:21:24,070 INFO L226 Difference]: Without dead ends: 178 [2018-01-24 12:21:24,071 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:21:24,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-01-24 12:21:24,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-01-24 12:21:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-01-24 12:21:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 195 transitions. [2018-01-24 12:21:24,088 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 195 transitions. Word has length 50 [2018-01-24 12:21:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:24,088 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 195 transitions. [2018-01-24 12:21:24,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:21:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 195 transitions. [2018-01-24 12:21:24,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 12:21:24,089 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:24,089 INFO L322 BasicCegarLoop]: trace histogram [9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:24,090 INFO L371 AbstractCegarLoop]: === Iteration 7 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash -202175989, now seen corresponding path program 3 times [2018-01-24 12:21:24,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:24,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:24,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:24,091 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:21:24,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:24,119 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-24 12:21:24,362 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:24,362 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:24,368 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:21:24,388 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:21:24,397 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:21:24,407 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:21:24,409 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:24,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:24,514 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 46 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-24 12:21:24,535 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:24,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-01-24 12:21:24,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-24 12:21:24,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-24 12:21:24,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-01-24 12:21:24,536 INFO L87 Difference]: Start difference. First operand 178 states and 195 transitions. Second operand 16 states. [2018-01-24 12:21:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:24,767 INFO L93 Difference]: Finished difference Result 355 states and 396 transitions. [2018-01-24 12:21:24,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:21:24,768 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-01-24 12:21:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:24,769 INFO L225 Difference]: With dead ends: 355 [2018-01-24 12:21:24,769 INFO L226 Difference]: Without dead ends: 179 [2018-01-24 12:21:24,770 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:21:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-24 12:21:24,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-01-24 12:21:24,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-01-24 12:21:24,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 196 transitions. [2018-01-24 12:21:24,786 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 196 transitions. Word has length 53 [2018-01-24 12:21:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:24,787 INFO L432 AbstractCegarLoop]: Abstraction has 179 states and 196 transitions. [2018-01-24 12:21:24,787 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-24 12:21:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 196 transitions. [2018-01-24 12:21:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 12:21:24,788 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:24,788 INFO L322 BasicCegarLoop]: trace histogram [12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:24,788 INFO L371 AbstractCegarLoop]: === Iteration 8 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash -734121745, now seen corresponding path program 4 times [2018-01-24 12:21:24,789 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:24,789 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:24,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:24,790 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:21:24,790 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:24,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-01-24 12:21:25,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:25,049 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:25,055 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-24 12:21:26,065 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:26,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 64 proven. 10 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-01-24 12:21:26,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:26,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-01-24 12:21:26,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-24 12:21:26,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-24 12:21:26,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:21:26,221 INFO L87 Difference]: Start difference. First operand 179 states and 196 transitions. Second operand 18 states. [2018-01-24 12:21:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:26,573 INFO L93 Difference]: Finished difference Result 357 states and 398 transitions. [2018-01-24 12:21:26,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:21:26,574 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2018-01-24 12:21:26,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:26,575 INFO L225 Difference]: With dead ends: 357 [2018-01-24 12:21:26,575 INFO L226 Difference]: Without dead ends: 180 [2018-01-24 12:21:26,577 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:21:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-01-24 12:21:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-01-24 12:21:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-01-24 12:21:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 197 transitions. [2018-01-24 12:21:26,594 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 197 transitions. Word has length 56 [2018-01-24 12:21:26,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:26,594 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 197 transitions. [2018-01-24 12:21:26,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-24 12:21:26,594 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 197 transitions. [2018-01-24 12:21:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-24 12:21:26,595 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:26,595 INFO L322 BasicCegarLoop]: trace histogram [15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:26,596 INFO L371 AbstractCegarLoop]: === Iteration 9 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1514307467, now seen corresponding path program 5 times [2018-01-24 12:21:26,596 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:26,596 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:26,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:26,597 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:21:26,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:26,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:27,091 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 50 proven. 58 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-01-24 12:21:27,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:27,091 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:27,096 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-24 12:21:27,107 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:27,114 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:27,123 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:27,538 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:39,561 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:21:39,583 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:39,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 133 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-01-24 12:21:39,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:39,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2018-01-24 12:21:39,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-24 12:21:39,798 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-24 12:21:39,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-01-24 12:21:39,798 INFO L87 Difference]: Start difference. First operand 180 states and 197 transitions. Second operand 27 states. [2018-01-24 12:21:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:41,728 INFO L93 Difference]: Finished difference Result 366 states and 408 transitions. [2018-01-24 12:21:41,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 12:21:41,728 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-01-24 12:21:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:41,729 INFO L225 Difference]: With dead ends: 366 [2018-01-24 12:21:41,730 INFO L226 Difference]: Without dead ends: 188 [2018-01-24 12:21:41,731 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2018-01-24 12:21:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-24 12:21:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2018-01-24 12:21:41,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-24 12:21:41,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2018-01-24 12:21:41,750 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 59 [2018-01-24 12:21:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:41,750 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2018-01-24 12:21:41,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-24 12:21:41,750 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2018-01-24 12:21:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-24 12:21:41,751 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:41,751 INFO L322 BasicCegarLoop]: trace histogram [18, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:21:41,752 INFO L371 AbstractCegarLoop]: === Iteration 10 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash -13135505, now seen corresponding path program 6 times [2018-01-24 12:21:41,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:41,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:41,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:41,753 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:21:41,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:41,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:42,117 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-01-24 12:21:42,117 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:42,117 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:42,134 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-24 12:21:42,156 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:21:42,160 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:21:42,171 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:21:42,192 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:21:42,346 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-24 12:21:42,349 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:21:42,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:42,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-01-24 12:21:42,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-01-24 12:21:42,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 12:21:42,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 12:21:42,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:21:42,430 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2018-01-24 12:21:42,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-24 12:21:42,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-01-24 12:21:42,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 12:21:42,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-01-24 12:21:42,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:42,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 12:21:42,877 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:41, output treesize:29 [2018-01-24 12:21:45,082 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:45,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-01-24 12:21:45,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:45,112 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:45,113 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:45,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-01-24 12:21:45,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:45,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:45,135 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:45,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-01-24 12:21:45,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:45,159 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:45,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2018-01-24 12:21:45,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:45,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 12:21:45,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-01-24 12:21:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 116 proven. 63 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-01-24 12:21:45,267 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:45,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2018-01-24 12:21:45,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-24 12:21:45,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-24 12:21:45,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=576, Unknown=2, NotChecked=0, Total=650 [2018-01-24 12:21:45,268 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand 26 states. [2018-01-24 12:21:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:50,633 INFO L93 Difference]: Finished difference Result 422 states and 473 transitions. [2018-01-24 12:21:50,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-24 12:21:50,633 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-01-24 12:21:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:50,634 INFO L225 Difference]: With dead ends: 422 [2018-01-24 12:21:50,634 INFO L226 Difference]: Without dead ends: 243 [2018-01-24 12:21:50,635 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=284, Invalid=1969, Unknown=3, NotChecked=0, Total=2256 [2018-01-24 12:21:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-24 12:21:50,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 197. [2018-01-24 12:21:50,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-01-24 12:21:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 222 transitions. [2018-01-24 12:21:50,663 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 222 transitions. Word has length 62 [2018-01-24 12:21:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:50,664 INFO L432 AbstractCegarLoop]: Abstraction has 197 states and 222 transitions. [2018-01-24 12:21:50,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-24 12:21:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 222 transitions. [2018-01-24 12:21:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 12:21:50,665 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:50,665 INFO L322 BasicCegarLoop]: trace histogram [21, 3, 3, 3, 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] [2018-01-24 12:21:50,665 INFO L371 AbstractCegarLoop]: === Iteration 11 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2002452483, now seen corresponding path program 1 times [2018-01-24 12:21:50,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:50,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:50,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:50,667 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:21:50,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:50,696 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:50,779 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-24 12:21:50,779 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:50,779 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:50,790 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:50,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-24 12:21:50,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:50,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-01-24 12:21:50,906 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 12:21:50,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 12:21:50,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:21:50,906 INFO L87 Difference]: Start difference. First operand 197 states and 222 transitions. Second operand 6 states. [2018-01-24 12:21:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:50,977 INFO L93 Difference]: Finished difference Result 197 states and 222 transitions. [2018-01-24 12:21:50,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:21:50,977 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-01-24 12:21:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:50,979 INFO L225 Difference]: With dead ends: 197 [2018-01-24 12:21:50,979 INFO L226 Difference]: Without dead ends: 196 [2018-01-24 12:21:50,979 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:21:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-24 12:21:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-01-24 12:21:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-01-24 12:21:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2018-01-24 12:21:51,012 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 70 [2018-01-24 12:21:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:51,013 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2018-01-24 12:21:51,013 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 12:21:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2018-01-24 12:21:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-24 12:21:51,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:51,014 INFO L322 BasicCegarLoop]: trace histogram [21, 3, 3, 3, 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] [2018-01-24 12:21:51,014 INFO L371 AbstractCegarLoop]: === Iteration 12 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:51,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2002452484, now seen corresponding path program 1 times [2018-01-24 12:21:51,015 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:51,015 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:51,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:51,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:51,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:51,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-24 12:21:51,167 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:51,167 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:21:51,168 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:21:51,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:21:51,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:21:51,168 INFO L87 Difference]: Start difference. First operand 196 states and 221 transitions. Second operand 7 states. [2018-01-24 12:21:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:51,307 INFO L93 Difference]: Finished difference Result 202 states and 226 transitions. [2018-01-24 12:21:51,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:21:51,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-01-24 12:21:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:51,309 INFO L225 Difference]: With dead ends: 202 [2018-01-24 12:21:51,309 INFO L226 Difference]: Without dead ends: 195 [2018-01-24 12:21:51,309 INFO L525 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-01-24 12:21:51,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-24 12:21:51,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-01-24 12:21:51,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 12:21:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 219 transitions. [2018-01-24 12:21:51,339 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 219 transitions. Word has length 70 [2018-01-24 12:21:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:51,340 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 219 transitions. [2018-01-24 12:21:51,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:21:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-01-24 12:21:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-24 12:21:51,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:51,341 INFO L322 BasicCegarLoop]: trace histogram [21, 3, 3, 3, 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] [2018-01-24 12:21:51,341 INFO L371 AbstractCegarLoop]: === Iteration 13 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:51,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1946516685, now seen corresponding path program 1 times [2018-01-24 12:21:51,342 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:51,342 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:51,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:51,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:51,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:51,366 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2018-01-24 12:21:51,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:21:51,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:21:51,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:21:51,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:21:51,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:21:51,477 INFO L87 Difference]: Start difference. First operand 195 states and 219 transitions. Second operand 7 states. [2018-01-24 12:21:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:21:51,664 INFO L93 Difference]: Finished difference Result 195 states and 219 transitions. [2018-01-24 12:21:51,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:21:51,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-01-24 12:21:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:21:51,666 INFO L225 Difference]: With dead ends: 195 [2018-01-24 12:21:51,666 INFO L226 Difference]: Without dead ends: 194 [2018-01-24 12:21:51,666 INFO L525 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-01-24 12:21:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-24 12:21:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-01-24 12:21:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-24 12:21:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2018-01-24 12:21:51,698 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 218 transitions. Word has length 71 [2018-01-24 12:21:51,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:21:51,698 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 218 transitions. [2018-01-24 12:21:51,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:21:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 218 transitions. [2018-01-24 12:21:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-24 12:21:51,699 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:21:51,700 INFO L322 BasicCegarLoop]: trace histogram [21, 3, 3, 3, 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] [2018-01-24 12:21:51,700 INFO L371 AbstractCegarLoop]: === Iteration 14 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:21:51,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1946516686, now seen corresponding path program 1 times [2018-01-24 12:21:51,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:21:51,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:21:51,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:51,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:51,702 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:21:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:51,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:21:52,078 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2018-01-24 12:21:52,078 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:21:52,078 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:21:52,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:21:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:21:52,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:21:52,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-01-24 12:21:52,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:52,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-01-24 12:21:52,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:52,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-01-24 12:21:52,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:52,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-01-24 12:21:52,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:52,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:21:52,223 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:46 [2018-01-24 12:21:53,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-01-24 12:21:53,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:53,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-01-24 12:21:53,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:53,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2018-01-24 12:21:53,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:53,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-01-24 12:21:53,298 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:53,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-01-24 12:21:53,306 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:41, output treesize:29 [2018-01-24 12:21:57,505 WARN L146 SmtUtils]: Spent 4053ms on a formula simplification. DAG size of input: 50 DAG size of output 29 [2018-01-24 12:21:57,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,524 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-01-24 12:21:57,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:57,594 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 54 [2018-01-24 12:21:57,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:57,682 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 47 [2018-01-24 12:21:57,685 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:57,765 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 58 [2018-01-24 12:21:57,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:57,828 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,829 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 59 [2018-01-24 12:21:57,830 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:57,891 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,892 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2018-01-24 12:21:57,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:57,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,948 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:57,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-01-24 12:21:57,949 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:58,003 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:58,004 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:21:58,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-01-24 12:21:58,005 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:21:58,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 8 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2018-01-24 12:21:58,055 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 24 variables, input treesize:209, output treesize:163 [2018-01-24 12:21:58,763 WARN L143 SmtUtils]: Spent 605ms on a formula simplification that was a NOOP. DAG size: 94 [2018-01-24 12:21:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 146 proven. 99 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2018-01-24 12:21:58,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:21:58,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 34 [2018-01-24 12:21:58,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-01-24 12:21:58,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-01-24 12:21:58,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1016, Unknown=7, NotChecked=0, Total=1122 [2018-01-24 12:21:58,828 INFO L87 Difference]: Start difference. First operand 194 states and 218 transitions. Second operand 34 states. [2018-01-24 12:22:02,541 WARN L146 SmtUtils]: Spent 384ms on a formula simplification. DAG size of input: 75 DAG size of output 72 [2018-01-24 12:22:06,986 WARN L146 SmtUtils]: Spent 2299ms on a formula simplification. DAG size of input: 91 DAG size of output 88 [2018-01-24 12:22:09,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:09,862 INFO L93 Difference]: Finished difference Result 422 states and 472 transitions. [2018-01-24 12:22:09,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-24 12:22:09,863 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 71 [2018-01-24 12:22:09,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:09,864 INFO L225 Difference]: With dead ends: 422 [2018-01-24 12:22:09,864 INFO L226 Difference]: Without dead ends: 230 [2018-01-24 12:22:09,865 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=250, Invalid=2292, Unknown=8, NotChecked=0, Total=2550 [2018-01-24 12:22:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-01-24 12:22:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 195. [2018-01-24 12:22:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-24 12:22:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 219 transitions. [2018-01-24 12:22:09,890 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 219 transitions. Word has length 71 [2018-01-24 12:22:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:09,890 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 219 transitions. [2018-01-24 12:22:09,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-01-24 12:22:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 219 transitions. [2018-01-24 12:22:09,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-01-24 12:22:09,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:09,891 INFO L322 BasicCegarLoop]: trace histogram [24, 3, 3, 3, 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] [2018-01-24 12:22:09,891 INFO L371 AbstractCegarLoop]: === Iteration 15 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:22:09,891 INFO L82 PathProgramCache]: Analyzing trace with hash 395214514, now seen corresponding path program 2 times [2018-01-24 12:22:09,891 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:09,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:09,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:09,892 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:09,892 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:09,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 174 proven. 36 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-24 12:22:10,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:10,280 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:22:10,291 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:22:10,316 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:22:10,338 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:22:10,343 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:22:10,346 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:10,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-01-24 12:22:10,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:10,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-24 12:22:10,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:10,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:22:10,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:36 [2018-01-24 12:22:11,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:22:11,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:22:11,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:11,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:22:11,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:22:11,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:22:11,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:11,539 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:22:11,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:11,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:64, output treesize:44 [2018-01-24 12:22:11,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-01-24 12:22:11,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2018-01-24 12:22:11,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:11,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:22:11,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-01-24 12:22:11,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-24 12:22:11,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:11,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:22:11,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:11,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:62, output treesize:32 [2018-01-24 12:22:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 176 proven. 36 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-01-24 12:22:11,726 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:11,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-01-24 12:22:11,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-24 12:22:11,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-24 12:22:11,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2018-01-24 12:22:11,727 INFO L87 Difference]: Start difference. First operand 195 states and 219 transitions. Second operand 33 states. [2018-01-24 12:22:16,233 WARN L146 SmtUtils]: Spent 4110ms on a formula simplification. DAG size of input: 86 DAG size of output 44 [2018-01-24 12:22:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:22:17,098 INFO L93 Difference]: Finished difference Result 197 states and 221 transitions. [2018-01-24 12:22:17,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-24 12:22:17,098 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2018-01-24 12:22:17,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:22:17,099 INFO L225 Difference]: With dead ends: 197 [2018-01-24 12:22:17,099 INFO L226 Difference]: Without dead ends: 196 [2018-01-24 12:22:17,099 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2018-01-24 12:22:17,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-01-24 12:22:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-01-24 12:22:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-01-24 12:22:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2018-01-24 12:22:17,158 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 218 transitions. Word has length 74 [2018-01-24 12:22:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:22:17,158 INFO L432 AbstractCegarLoop]: Abstraction has 194 states and 218 transitions. [2018-01-24 12:22:17,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-24 12:22:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 218 transitions. [2018-01-24 12:22:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-01-24 12:22:17,159 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:22:17,159 INFO L322 BasicCegarLoop]: trace histogram [24, 3, 3, 3, 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] [2018-01-24 12:22:17,159 INFO L371 AbstractCegarLoop]: === Iteration 16 === [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, ldv_arvo_init_specials_unsafeErr3RequiresViolation, ldv_arvo_init_specials_unsafeErr1RequiresViolation, ldv_arvo_init_specials_unsafeErr5RequiresViolation, ldv_arvo_init_specials_unsafeErr4RequiresViolation, ldv_arvo_init_specials_unsafeErr2RequiresViolation, ldv_arvo_init_specials_unsafeErr0RequiresViolation, ldv_arvo_init_specials_unsafeErr6RequiresViolation, ldv_arvo_init_specials_unsafeErr7RequiresViolation]=== [2018-01-24 12:22:17,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1844027634, now seen corresponding path program 1 times [2018-01-24 12:22:17,160 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:22:17,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:22:17,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:17,161 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:22:17,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:22:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:17,202 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:22:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-01-24 12:22:17,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:22:17,440 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:22:17,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:22:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:22:17,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:22:17,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:22:17,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:17,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:22:17,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:22:17,576 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:17,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 12:22:17,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:17,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:17,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:22:17,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:17,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:17,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-01-24 12:22:17,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:17,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:17,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-01-24 12:22:17,636 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:17,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-24 12:22:17,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:17,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:17,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:22:17,685 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:17,686 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:17,687 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:22:17,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-01-24 12:22:17,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:17,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:17,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:28 [2018-01-24 12:22:17,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 12:22:17,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 12:22:17,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:22:17,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:22:17,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:17,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:46 [2018-01-24 12:22:17,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2018-01-24 12:22:17,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-01-24 12:22:17,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:17,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:17,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:22:17,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:46, output treesize:28 [2018-01-24 12:22:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2018-01-24 12:22:17,841 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:22:17,841 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2018-01-24 12:22:17,841 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-24 12:22:17,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-24 12:22:17,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:22:17,842 INFO L87 Difference]: Start difference. First operand 194 states and 218 transitions. Second operand 21 states. Received shutdown request... [2018-01-24 12:22:18,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:22:18,114 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:22:18,119 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:22:18,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:22:18 BoogieIcfgContainer [2018-01-24 12:22:18,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:22:18,120 INFO L168 Benchmark]: Toolchain (without parser) took 59276.52 ms. Allocated memory was 306.2 MB in the beginning and 657.5 MB in the end (delta: 351.3 MB). Free memory was 265.2 MB in the beginning and 378.5 MB in the end (delta: -113.3 MB). Peak memory consumption was 238.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:22:18,121 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:22:18,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.86 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 250.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:22:18,122 INFO L168 Benchmark]: Boogie Preprocessor took 44.90 ms. Allocated memory is still 306.2 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:22:18,122 INFO L168 Benchmark]: RCFGBuilder took 588.31 ms. Allocated memory is still 306.2 MB. Free memory was 248.2 MB in the beginning and 209.5 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 5.3 GB. [2018-01-24 12:22:18,122 INFO L168 Benchmark]: TraceAbstraction took 58394.53 ms. Allocated memory was 306.2 MB in the beginning and 657.5 MB in the end (delta: 351.3 MB). Free memory was 208.5 MB in the beginning and 378.5 MB in the end (delta: -170.0 MB). Peak memory consumption was 181.3 MB. Max. memory is 5.3 GB. [2018-01-24 12:22:18,124 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.13 ms. Allocated memory is still 306.2 MB. Free memory is still 272.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 242.86 ms. Allocated memory is still 306.2 MB. Free memory was 265.2 MB in the beginning and 250.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.90 ms. Allocated memory is still 306.2 MB. Free memory was 250.2 MB in the beginning and 248.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 588.31 ms. Allocated memory is still 306.2 MB. Free memory was 248.2 MB in the beginning and 209.5 MB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 58394.53 ms. Allocated memory was 306.2 MB in the beginning and 657.5 MB in the end (delta: 351.3 MB). Free memory was 208.5 MB in the beginning and 378.5 MB in the end (delta: -170.0 MB). Peak memory consumption was 181.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 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1198). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1193). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1533]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 1533). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1513). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1526). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1528). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1516). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1514). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1517). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1524). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1456). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1454). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1455). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1484). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1490). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1486). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1464). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1463). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1479). Cancelled while BasicCegarLoop was constructing difference of abstraction (194states) and interpolant automaton (currently 13 states, 21 states before enhancement), while ReachableStatesComputation was computing reachable states (56 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 165 locations, 45 error locations. TIMEOUT Result, 58.3s OverallTime, 16 OverallIterations, 24 TraceHistogramMax, 26.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2204 SDtfs, 1555 SDslu, 18689 SDs, 0 SdLazy, 12016 SolverSat, 472 SolverUnsat, 37 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 956 GetRequests, 616 SyntacticMatches, 24 SemanticMatches, 316 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 25.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 120 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 14.4s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 1608 NumberOfCodeBlocks, 1580 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1580 ConstructedInterpolants, 153 QuantifiedInterpolants, 577779 SizeOfPredicates, 47 NumberOfNonLiveVariables, 3352 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 28 InterpolantComputations, 5 PerfectInterpolantSequences, 4155/4954 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-22-18-131.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-22-18-131.csv Completed graceful shutdown