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/mempurity-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-47db877 [2018-01-23 14:47:50,968 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-23 14:47:50,971 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-23 14:47:50,985 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-23 14:47:50,986 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-23 14:47:50,986 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-23 14:47:50,987 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-23 14:47:50,989 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-23 14:47:50,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-23 14:47:50,993 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-23 14:47:50,994 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-23 14:47:50,994 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-23 14:47:50,995 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-23 14:47:50,995 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-23 14:47:50,996 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-23 14:47:50,999 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-23 14:47:51,001 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-23 14:47:51,003 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-23 14:47:51,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-23 14:47:51,005 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-23 14:47:51,008 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-23 14:47:51,008 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-23 14:47:51,008 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-23 14:47:51,009 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-23 14:47:51,010 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-23 14:47:51,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-23 14:47:51,012 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-23 14:47:51,013 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-23 14:47:51,013 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-23 14:47:51,013 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-23 14:47:51,014 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-23 14:47:51,014 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Camel+AI_EQ.epf [2018-01-23 14:47:51,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-23 14:47:51,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-23 14:47:51,026 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-23 14:47:51,026 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-23 14:47:51,026 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-23 14:47:51,026 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-23 14:47:51,026 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-23 14:47:51,027 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-23 14:47:51,027 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-23 14:47:51,027 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-23 14:47:51,028 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-23 14:47:51,028 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-23 14:47:51,028 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-23 14:47:51,028 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-23 14:47:51,028 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-23 14:47:51,029 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-23 14:47:51,029 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-23 14:47:51,029 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-23 14:47:51,029 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-23 14:47:51,029 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-23 14:47:51,029 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-23 14:47:51,030 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-23 14:47:51,030 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-23 14:47:51,030 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-23 14:47:51,030 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-23 14:47:51,030 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-23 14:47:51,031 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-23 14:47:51,031 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-23 14:47:51,031 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-23 14:47:51,031 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-23 14:47:51,031 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-23 14:47:51,031 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-23 14:47:51,032 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-23 14:47:51,032 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-23 14:47:51,032 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-23 14:47:51,033 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-23 14:47:51,033 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-23 14:47:51,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-23 14:47:51,081 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-23 14:47:51,085 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-23 14:47:51,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-23 14:47:51,088 INFO L276 PluginConnector]: CDTParser initialized [2018-01-23 14:47:51,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test15_true-valid-memsafety_true-termination.i [2018-01-23 14:47:51,307 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-23 14:47:51,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-23 14:47:51,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-23 14:47:51,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-23 14:47:51,316 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-23 14:47:51,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:47:51" (1/1) ... [2018-01-23 14:47:51,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51, skipping insertion in model container [2018-01-23 14:47:51,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 02:47:51" (1/1) ... [2018-01-23 14:47:51,332 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:47:51,379 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-23 14:47:51,497 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:47:51,524 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-23 14:47:51,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51 WrapperNode [2018-01-23 14:47:51,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-23 14:47:51,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-23 14:47:51,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-23 14:47:51,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-23 14:47:51,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51" (1/1) ... [2018-01-23 14:47:51,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51" (1/1) ... [2018-01-23 14:47:51,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51" (1/1) ... [2018-01-23 14:47:51,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51" (1/1) ... [2018-01-23 14:47:51,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51" (1/1) ... [2018-01-23 14:47:51,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51" (1/1) ... [2018-01-23 14:47:51,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51" (1/1) ... [2018-01-23 14:47:51,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-23 14:47:51,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-23 14:47:51,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-23 14:47:51,586 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-23 14:47:51,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51" (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-23 14:47:51,631 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-23 14:47:51,631 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-23 14:47:51,631 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-01-23 14:47:51,631 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-23 14:47:51,631 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-01-23 14:47:51,631 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-01-23 14:47:51,631 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-01-23 14:47:51,632 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_get_drvdata [2018-01-23 14:47:51,632 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_hid_set_drvdata [2018-01-23 14:47:51,632 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_arvo_device_struct [2018-01-23 14:47:51,632 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_init_specials [2018-01-23 14:47:51,632 INFO L136 BoogieDeclarations]: Found implementation of procedure lvd_arvo_remove_specials [2018-01-23 14:47:51,632 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_probe [2018-01-23 14:47:51,632 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_arvo_remove [2018-01-23 14:47:51,632 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-23 14:47:51,632 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-23 14:47:51,632 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-23 14:47:51,633 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-23 14:47:51,633 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-23 14:47:51,633 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-23 14:47:51,633 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-23 14:47:51,633 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-23 14:47:51,633 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-23 14:47:51,633 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-01-23 14:47:51,633 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-01-23 14:47:51,633 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_get_drvdata [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_hid_set_drvdata [2018-01-23 14:47:51,634 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_arvo_device_struct [2018-01-23 14:47:51,635 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_init_specials [2018-01-23 14:47:51,635 INFO L128 BoogieDeclarations]: Found specification of procedure lvd_arvo_remove_specials [2018-01-23 14:47:51,635 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_probe [2018-01-23 14:47:51,635 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_arvo_remove [2018-01-23 14:47:51,635 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-23 14:47:51,635 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-23 14:47:51,635 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-23 14:47:51,635 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-23 14:47:52,119 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-23 14:47:52,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:47:52 BoogieIcfgContainer [2018-01-23 14:47:52,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-23 14:47:52,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-23 14:47:52,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-23 14:47:52,123 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-23 14:47:52,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 02:47:51" (1/3) ... [2018-01-23 14:47:52,124 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c651995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:47:52, skipping insertion in model container [2018-01-23 14:47:52,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 02:47:51" (2/3) ... [2018-01-23 14:47:52,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c651995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 02:47:52, skipping insertion in model container [2018-01-23 14:47:52,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 02:47:52" (3/3) ... [2018-01-23 14:47:52,127 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test15_true-valid-memsafety_true-termination.i [2018-01-23 14:47:52,133 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-23 14:47:52,140 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-01-23 14:47:52,184 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:52,184 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:52,185 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:52,185 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:52,185 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:52,185 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:52,185 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:52,185 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-23 14:47:52,186 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:52,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-23 14:47:52,215 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:52,216 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:52,216 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-23 14:47:52,220 INFO L82 PathProgramCache]: Analyzing trace with hash -98013340, now seen corresponding path program 1 times [2018-01-23 14:47:52,221 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:52,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:52,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:52,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:52,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:52,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:52,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:52,478 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-23 14:47:52,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:47:52,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:47:52,483 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:47:52,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:47:52,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:47:52,497 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-01-23 14:47:52,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:52,714 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2018-01-23 14:47:52,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:47:52,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-01-23 14:47:52,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:52,723 INFO L225 Difference]: With dead ends: 154 [2018-01-23 14:47:52,724 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:52,729 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:47:52,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:52,755 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2018-01-23 14:47:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:52,756 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:52,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:47:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:52,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:52,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-23 14:47:52,874 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1533 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,874 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1533 1535) no Hoare annotation was computed. [2018-01-23 14:47:52,874 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1533 1535) no Hoare annotation was computed. [2018-01-23 14:47:52,874 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1533 1535) no Hoare annotation was computed. [2018-01-23 14:47:52,874 INFO L401 ceAbstractionStarter]: For program point L1490(line 1490) no Hoare annotation was computed. [2018-01-23 14:47:52,874 INFO L401 ceAbstractionStarter]: For program point L1486'(line 1486) no Hoare annotation was computed. [2018-01-23 14:47:52,874 INFO L401 ceAbstractionStarter]: For program point L1486''(line 1486) no Hoare annotation was computed. [2018-01-23 14:47:52,875 INFO L397 ceAbstractionStarter]: At program point lvd_arvo_remove_specialsENTRY(lines 1483 1491) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,875 INFO L401 ceAbstractionStarter]: For program point L1484'(line 1484) no Hoare annotation was computed. [2018-01-23 14:47:52,875 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsFINAL(lines 1483 1491) no Hoare annotation was computed. [2018-01-23 14:47:52,875 INFO L401 ceAbstractionStarter]: For program point L1486(line 1486) no Hoare annotation was computed. [2018-01-23 14:47:52,875 INFO L401 ceAbstractionStarter]: For program point L1489'(line 1489) no Hoare annotation was computed. [2018-01-23 14:47:52,875 INFO L401 ceAbstractionStarter]: For program point L1484(line 1484) no Hoare annotation was computed. [2018-01-23 14:47:52,876 INFO L397 ceAbstractionStarter]: At program point L1489(line 1489) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,876 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsErr0EnsuresViolation(lines 1483 1491) no Hoare annotation was computed. [2018-01-23 14:47:52,876 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsEXIT(lines 1483 1491) no Hoare annotation was computed. [2018-01-23 14:47:52,876 INFO L397 ceAbstractionStarter]: At program point L1505(line 1505) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,876 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_removeENTRY(lines 1504 1506) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,876 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeFINAL(lines 1504 1506) no Hoare annotation was computed. [2018-01-23 14:47:52,876 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeErr0EnsuresViolation(lines 1504 1506) no Hoare annotation was computed. [2018-01-23 14:47:52,877 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeEXIT(lines 1504 1506) no Hoare annotation was computed. [2018-01-23 14:47:52,877 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,877 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-23 14:47:52,877 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-23 14:47:52,877 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:47:52,877 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:47:52,877 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:47:52,878 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-23 14:47:52,878 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:52,878 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:52,878 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,878 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:52,878 INFO L401 ceAbstractionStarter]: For program point L1463'(line 1463) no Hoare annotation was computed. [2018-01-23 14:47:52,878 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsErr0EnsuresViolation(lines 1460 1481) no Hoare annotation was computed. [2018-01-23 14:47:52,879 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-23 14:47:52,879 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsFINAL(lines 1460 1481) no Hoare annotation was computed. [2018-01-23 14:47:52,879 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_init_specialsENTRY(lines 1460 1481) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,879 INFO L397 ceAbstractionStarter]: At program point L1476(line 1476) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,879 INFO L397 ceAbstractionStarter]: At program point L1474(line 1474) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,879 INFO L397 ceAbstractionStarter]: At program point L1472(line 1472) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,879 INFO L401 ceAbstractionStarter]: For program point L1473(lines 1473 1475) no Hoare annotation was computed. [2018-01-23 14:47:52,879 INFO L401 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2018-01-23 14:47:52,880 INFO L401 ceAbstractionStarter]: For program point L1464''(line 1464) no Hoare annotation was computed. [2018-01-23 14:47:52,880 INFO L401 ceAbstractionStarter]: For program point L1464'(line 1464) no Hoare annotation was computed. [2018-01-23 14:47:52,880 INFO L401 ceAbstractionStarter]: For program point L1476'(line 1476) no Hoare annotation was computed. [2018-01-23 14:47:52,880 INFO L401 ceAbstractionStarter]: For program point L1472'(line 1472) no Hoare annotation was computed. [2018-01-23 14:47:52,880 INFO L397 ceAbstractionStarter]: At program point L1465(line 1465) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,880 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-23 14:47:52,880 INFO L401 ceAbstractionStarter]: For program point L1464(line 1464) no Hoare annotation was computed. [2018-01-23 14:47:52,881 INFO L401 ceAbstractionStarter]: For program point L1468'(line 1468) no Hoare annotation was computed. [2018-01-23 14:47:52,881 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-23 14:47:52,881 INFO L397 ceAbstractionStarter]: At program point L1468(line 1468) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,881 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsEXIT(lines 1460 1481) no Hoare annotation was computed. [2018-01-23 14:47:52,881 INFO L404 ceAbstractionStarter]: At program point ldv_dev_set_drvdataENTRY(lines 1196 1199) the Hoare annotation is: true [2018-01-23 14:47:52,881 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataEXIT(lines 1196 1199) no Hoare annotation was computed. [2018-01-23 14:47:52,881 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataFINAL(lines 1196 1199) no Hoare annotation was computed. [2018-01-23 14:47:52,882 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataErr0EnsuresViolation(lines 1196 1199) no Hoare annotation was computed. [2018-01-23 14:47:52,882 INFO L401 ceAbstractionStarter]: For program point L1198(line 1198) no Hoare annotation was computed. [2018-01-23 14:47:52,882 INFO L404 ceAbstractionStarter]: At program point ldv_hid_set_drvdataENTRY(lines 1444 1447) the Hoare annotation is: true [2018-01-23 14:47:52,882 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataEXIT(lines 1444 1447) no Hoare annotation was computed. [2018-01-23 14:47:52,882 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataErr0EnsuresViolation(lines 1444 1447) no Hoare annotation was computed. [2018-01-23 14:47:52,882 INFO L404 ceAbstractionStarter]: At program point L1446(line 1446) the Hoare annotation is: true [2018-01-23 14:47:52,882 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataFINAL(lines 1444 1447) no Hoare annotation was computed. [2018-01-23 14:47:52,883 INFO L401 ceAbstractionStarter]: For program point L1081(line 1081) no Hoare annotation was computed. [2018-01-23 14:47:52,883 INFO L401 ceAbstractionStarter]: For program point L1081''(line 1081) no Hoare annotation was computed. [2018-01-23 14:47:52,883 INFO L401 ceAbstractionStarter]: For program point ldv_zallocEXIT(lines 1080 1082) no Hoare annotation was computed. [2018-01-23 14:47:52,883 INFO L401 ceAbstractionStarter]: For program point ldv_zallocErr0EnsuresViolation(lines 1080 1082) no Hoare annotation was computed. [2018-01-23 14:47:52,883 INFO L404 ceAbstractionStarter]: At program point L1081'(line 1081) the Hoare annotation is: true [2018-01-23 14:47:52,883 INFO L397 ceAbstractionStarter]: At program point ldv_zallocENTRY(lines 1080 1082) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,883 INFO L401 ceAbstractionStarter]: For program point ldv_zallocFINAL(lines 1080 1082) no Hoare annotation was computed. [2018-01-23 14:47:52,883 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveFINAL(lines 1057 1061) no Hoare annotation was computed. [2018-01-23 14:47:52,883 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveErr0EnsuresViolation(lines 1057 1061) no Hoare annotation was computed. [2018-01-23 14:47:52,884 INFO L401 ceAbstractionStarter]: For program point L1059(lines 1059 1060) no Hoare annotation was computed. [2018-01-23 14:47:52,884 INFO L404 ceAbstractionStarter]: At program point ldv_nonpositiveENTRY(lines 1057 1061) the Hoare annotation is: true [2018-01-23 14:47:52,884 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveEXIT(lines 1057 1061) no Hoare annotation was computed. [2018-01-23 14:47:52,884 INFO L401 ceAbstractionStarter]: For program point L1441'(line 1441) no Hoare annotation was computed. [2018-01-23 14:47:52,884 INFO L404 ceAbstractionStarter]: At program point ldv_hid_get_drvdataENTRY(lines 1439 1442) the Hoare annotation is: true [2018-01-23 14:47:52,884 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataFINAL(lines 1439 1442) no Hoare annotation was computed. [2018-01-23 14:47:52,884 INFO L404 ceAbstractionStarter]: At program point L1441(line 1441) the Hoare annotation is: true [2018-01-23 14:47:52,884 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataErr0EnsuresViolation(lines 1439 1442) no Hoare annotation was computed. [2018-01-23 14:47:52,884 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataEXIT(lines 1439 1442) no Hoare annotation was computed. [2018-01-23 14:47:52,884 INFO L404 ceAbstractionStarter]: At program point ldv_dev_get_drvdataENTRY(lines 1191 1194) the Hoare annotation is: true [2018-01-23 14:47:52,884 INFO L401 ceAbstractionStarter]: For program point L1193(line 1193) no Hoare annotation was computed. [2018-01-23 14:47:52,885 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataEXIT(lines 1191 1194) no Hoare annotation was computed. [2018-01-23 14:47:52,885 INFO L401 ceAbstractionStarter]: For program point L1193'(line 1193) no Hoare annotation was computed. [2018-01-23 14:47:52,885 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataFINAL(lines 1191 1194) no Hoare annotation was computed. [2018-01-23 14:47:52,885 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataErr0EnsuresViolation(lines 1191 1194) no Hoare annotation was computed. [2018-01-23 14:47:52,885 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1535) the Hoare annotation is: true [2018-01-23 14:47:52,885 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:52,885 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1535) the Hoare annotation is: true [2018-01-23 14:47:52,885 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:52,886 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:52,886 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-23 14:47:52,886 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-01-23 14:47:52,886 INFO L404 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-01-23 14:47:52,886 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-01-23 14:47:52,886 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_probeENTRY(lines 1493 1502) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,886 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeErr0EnsuresViolation(lines 1493 1502) no Hoare annotation was computed. [2018-01-23 14:47:52,886 INFO L401 ceAbstractionStarter]: For program point L1495'(line 1495) no Hoare annotation was computed. [2018-01-23 14:47:52,887 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeFINAL(lines 1493 1502) no Hoare annotation was computed. [2018-01-23 14:47:52,887 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeEXIT(lines 1493 1502) no Hoare annotation was computed. [2018-01-23 14:47:52,887 INFO L401 ceAbstractionStarter]: For program point L1496(lines 1496 1498) no Hoare annotation was computed. [2018-01-23 14:47:52,887 INFO L397 ceAbstractionStarter]: At program point L1497(line 1497) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,887 INFO L397 ceAbstractionStarter]: At program point L1495(line 1495) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,887 INFO L401 ceAbstractionStarter]: For program point L1510(line 1510) no Hoare annotation was computed. [2018-01-23 14:47:52,887 INFO L401 ceAbstractionStarter]: For program point L1516'(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:52,887 INFO L401 ceAbstractionStarter]: For program point L1513''(line 1513) no Hoare annotation was computed. [2018-01-23 14:47:52,887 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1508 1531) no Hoare annotation was computed. [2018-01-23 14:47:52,887 INFO L401 ceAbstractionStarter]: For program point L1516''(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:52,887 INFO L401 ceAbstractionStarter]: For program point L1524'(line 1524) no Hoare annotation was computed. [2018-01-23 14:47:52,888 INFO L401 ceAbstractionStarter]: For program point L1514'(line 1514) no Hoare annotation was computed. [2018-01-23 14:47:52,888 INFO L401 ceAbstractionStarter]: For program point L1517(line 1517) no Hoare annotation was computed. [2018-01-23 14:47:52,888 INFO L401 ceAbstractionStarter]: For program point L1516(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:52,888 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1508 1531) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,888 INFO L397 ceAbstractionStarter]: At program point L1513(line 1513) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,888 INFO L401 ceAbstractionStarter]: For program point L1514(line 1514) no Hoare annotation was computed. [2018-01-23 14:47:52,888 INFO L397 ceAbstractionStarter]: At program point L1511(line 1511) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,888 INFO L401 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2018-01-23 14:47:52,889 INFO L401 ceAbstractionStarter]: For program point L1519(line 1519) no Hoare annotation was computed. [2018-01-23 14:47:52,889 INFO L397 ceAbstractionStarter]: At program point L1520(line 1520) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,889 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1508 1531) no Hoare annotation was computed. [2018-01-23 14:47:52,889 INFO L397 ceAbstractionStarter]: At program point L1517'(line 1517) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:52,889 INFO L401 ceAbstractionStarter]: For program point L1511'(line 1511) no Hoare annotation was computed. [2018-01-23 14:47:52,889 INFO L401 ceAbstractionStarter]: For program point L1513'(line 1513) no Hoare annotation was computed. [2018-01-23 14:47:52,889 INFO L404 ceAbstractionStarter]: At program point L1528(line 1528) the Hoare annotation is: true [2018-01-23 14:47:52,890 INFO L404 ceAbstractionStarter]: At program point L1526(line 1526) the Hoare annotation is: true [2018-01-23 14:47:52,890 INFO L401 ceAbstractionStarter]: For program point L1519'(lines 1519 1521) no Hoare annotation was computed. [2018-01-23 14:47:52,890 INFO L401 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2018-01-23 14:47:52,890 INFO L401 ceAbstractionStarter]: For program point L1516'''(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:52,890 INFO L404 ceAbstractionStarter]: At program point L1525(lines 1525 1526) the Hoare annotation is: true [2018-01-23 14:47:52,890 INFO L401 ceAbstractionStarter]: For program point L1523(lines 1523 1524) no Hoare annotation was computed. [2018-01-23 14:47:52,890 INFO L401 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2018-01-23 14:47:52,890 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-23 14:47:52,890 INFO L401 ceAbstractionStarter]: For program point L1455'(line 1455) no Hoare annotation was computed. [2018-01-23 14:47:52,890 INFO L404 ceAbstractionStarter]: At program point ldv_arvo_init_arvo_device_structENTRY(lines 1453 1458) the Hoare annotation is: true [2018-01-23 14:47:52,890 INFO L401 ceAbstractionStarter]: For program point L1456(line 1456) no Hoare annotation was computed. [2018-01-23 14:47:52,890 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structFINAL(lines 1453 1458) no Hoare annotation was computed. [2018-01-23 14:47:52,891 INFO L404 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: true [2018-01-23 14:47:52,891 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-23 14:47:52,891 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-23 14:47:52,891 INFO L401 ceAbstractionStarter]: For program point L1456'(line 1456) no Hoare annotation was computed. [2018-01-23 14:47:52,891 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-23 14:47:52,891 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structEXIT(lines 1453 1458) no Hoare annotation was computed. [2018-01-23 14:47:52,891 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structErr0EnsuresViolation(lines 1453 1458) no Hoare annotation was computed. [2018-01-23 14:47:52,896 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:52,896 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:52,896 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:52,896 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:52,896 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:52,896 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:52,897 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:52,897 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == lvd_arvo_remove_specialsErr0EnsuresViolation======== [2018-01-23 14:47:52,897 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-23 14:47:52,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:52,906 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:52,906 INFO L371 AbstractCegarLoop]: === Iteration 1 === [lvd_arvo_remove_specialsErr0EnsuresViolation]=== [2018-01-23 14:47:52,906 INFO L82 PathProgramCache]: Analyzing trace with hash -930138460, now seen corresponding path program 1 times [2018-01-23 14:47:52,906 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:52,906 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:52,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:52,908 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:52,908 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:52,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:53,053 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:53,053 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-23 14:47:53,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:53,142 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:53,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:53,217 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-01-23 14:47:53,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:47:53,218 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:47:53,218 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:47:53,218 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2018-01-23 14:47:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:53,563 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2018-01-23 14:47:53,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:47:53,563 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-01-23 14:47:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:53,567 INFO L225 Difference]: With dead ends: 279 [2018-01-23 14:47:53,567 INFO L226 Difference]: Without dead ends: 118 [2018-01-23 14:47:53,568 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:47:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-23 14:47:53,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-01-23 14:47:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-23 14:47:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2018-01-23 14:47:53,590 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 71 [2018-01-23 14:47:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:53,590 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2018-01-23 14:47:53,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:47:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2018-01-23 14:47:53,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-01-23 14:47:53,594 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:53,594 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:47:53,594 INFO L371 AbstractCegarLoop]: === Iteration 2 === [lvd_arvo_remove_specialsErr0EnsuresViolation]=== [2018-01-23 14:47:53,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1020427369, now seen corresponding path program 1 times [2018-01-23 14:47:53,594 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:53,594 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:53,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:53,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:53,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:53,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:47:53,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:53,685 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-23 14:47:53,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:53,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:53,785 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc2.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc2.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0))) is different from true [2018-01-23 14:47:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:47:53,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:53,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:47:53,830 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:53,831 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:53,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-23 14:47:53,831 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 5 states. [2018-01-23 14:47:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:53,910 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2018-01-23 14:47:53,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:47:53,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2018-01-23 14:47:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:53,911 INFO L225 Difference]: With dead ends: 124 [2018-01-23 14:47:53,911 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:53,912 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-23 14:47:53,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:53,913 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86 [2018-01-23 14:47:53,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:53,914 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:53,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:53,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:53,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-23 14:47:53,991 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1533 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,991 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1533 1535) no Hoare annotation was computed. [2018-01-23 14:47:53,991 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1533 1535) no Hoare annotation was computed. [2018-01-23 14:47:53,991 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1533 1535) no Hoare annotation was computed. [2018-01-23 14:47:53,991 INFO L401 ceAbstractionStarter]: For program point L1490(line 1490) no Hoare annotation was computed. [2018-01-23 14:47:53,991 INFO L401 ceAbstractionStarter]: For program point L1486'(line 1486) no Hoare annotation was computed. [2018-01-23 14:47:53,992 INFO L401 ceAbstractionStarter]: For program point L1486''(line 1486) no Hoare annotation was computed. [2018-01-23 14:47:53,992 INFO L397 ceAbstractionStarter]: At program point lvd_arvo_remove_specialsENTRY(lines 1483 1491) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,992 INFO L401 ceAbstractionStarter]: For program point L1484'(line 1484) no Hoare annotation was computed. [2018-01-23 14:47:53,992 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsFINAL(lines 1483 1491) no Hoare annotation was computed. [2018-01-23 14:47:53,992 INFO L401 ceAbstractionStarter]: For program point L1486(line 1486) no Hoare annotation was computed. [2018-01-23 14:47:53,992 INFO L401 ceAbstractionStarter]: For program point L1489'(line 1489) no Hoare annotation was computed. [2018-01-23 14:47:53,992 INFO L401 ceAbstractionStarter]: For program point L1484(line 1484) no Hoare annotation was computed. [2018-01-23 14:47:53,992 INFO L397 ceAbstractionStarter]: At program point L1489(line 1489) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,992 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsErr0EnsuresViolation(lines 1483 1491) no Hoare annotation was computed. [2018-01-23 14:47:53,993 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsEXIT(lines 1483 1491) no Hoare annotation was computed. [2018-01-23 14:47:53,993 INFO L397 ceAbstractionStarter]: At program point L1505(line 1505) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,993 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_removeENTRY(lines 1504 1506) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,993 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeFINAL(lines 1504 1506) no Hoare annotation was computed. [2018-01-23 14:47:53,993 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeErr0EnsuresViolation(lines 1504 1506) no Hoare annotation was computed. [2018-01-23 14:47:53,993 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeEXIT(lines 1504 1506) no Hoare annotation was computed. [2018-01-23 14:47:53,993 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,993 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-23 14:47:53,993 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-23 14:47:53,993 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:47:53,993 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:47:53,993 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:47:53,994 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-23 14:47:53,994 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:53,994 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:53,994 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,994 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:53,994 INFO L401 ceAbstractionStarter]: For program point L1463'(line 1463) no Hoare annotation was computed. [2018-01-23 14:47:53,994 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsErr0EnsuresViolation(lines 1460 1481) no Hoare annotation was computed. [2018-01-23 14:47:53,994 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-23 14:47:53,994 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsFINAL(lines 1460 1481) no Hoare annotation was computed. [2018-01-23 14:47:53,995 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_init_specialsENTRY(lines 1460 1481) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,995 INFO L397 ceAbstractionStarter]: At program point L1476(line 1476) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,995 INFO L397 ceAbstractionStarter]: At program point L1474(line 1474) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,995 INFO L397 ceAbstractionStarter]: At program point L1472(line 1472) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,995 INFO L401 ceAbstractionStarter]: For program point L1473(lines 1473 1475) no Hoare annotation was computed. [2018-01-23 14:47:53,995 INFO L401 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2018-01-23 14:47:53,995 INFO L401 ceAbstractionStarter]: For program point L1464''(line 1464) no Hoare annotation was computed. [2018-01-23 14:47:53,995 INFO L401 ceAbstractionStarter]: For program point L1464'(line 1464) no Hoare annotation was computed. [2018-01-23 14:47:53,995 INFO L401 ceAbstractionStarter]: For program point L1476'(line 1476) no Hoare annotation was computed. [2018-01-23 14:47:53,995 INFO L401 ceAbstractionStarter]: For program point L1472'(line 1472) no Hoare annotation was computed. [2018-01-23 14:47:53,995 INFO L397 ceAbstractionStarter]: At program point L1465(line 1465) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point L1464(line 1464) no Hoare annotation was computed. [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point L1468'(line 1468) no Hoare annotation was computed. [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-23 14:47:53,996 INFO L397 ceAbstractionStarter]: At program point L1468(line 1468) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsEXIT(lines 1460 1481) no Hoare annotation was computed. [2018-01-23 14:47:53,996 INFO L404 ceAbstractionStarter]: At program point ldv_dev_set_drvdataENTRY(lines 1196 1199) the Hoare annotation is: true [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataEXIT(lines 1196 1199) no Hoare annotation was computed. [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataFINAL(lines 1196 1199) no Hoare annotation was computed. [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataErr0EnsuresViolation(lines 1196 1199) no Hoare annotation was computed. [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point L1198(line 1198) no Hoare annotation was computed. [2018-01-23 14:47:53,996 INFO L404 ceAbstractionStarter]: At program point ldv_hid_set_drvdataENTRY(lines 1444 1447) the Hoare annotation is: true [2018-01-23 14:47:53,996 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataEXIT(lines 1444 1447) no Hoare annotation was computed. [2018-01-23 14:47:53,997 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataErr0EnsuresViolation(lines 1444 1447) no Hoare annotation was computed. [2018-01-23 14:47:53,997 INFO L404 ceAbstractionStarter]: At program point L1446(line 1446) the Hoare annotation is: true [2018-01-23 14:47:53,997 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataFINAL(lines 1444 1447) no Hoare annotation was computed. [2018-01-23 14:47:53,997 INFO L401 ceAbstractionStarter]: For program point L1081(line 1081) no Hoare annotation was computed. [2018-01-23 14:47:53,997 INFO L401 ceAbstractionStarter]: For program point L1081''(line 1081) no Hoare annotation was computed. [2018-01-23 14:47:53,997 INFO L401 ceAbstractionStarter]: For program point ldv_zallocEXIT(lines 1080 1082) no Hoare annotation was computed. [2018-01-23 14:47:53,997 INFO L401 ceAbstractionStarter]: For program point ldv_zallocErr0EnsuresViolation(lines 1080 1082) no Hoare annotation was computed. [2018-01-23 14:47:53,998 INFO L404 ceAbstractionStarter]: At program point L1081'(line 1081) the Hoare annotation is: true [2018-01-23 14:47:53,998 INFO L397 ceAbstractionStarter]: At program point ldv_zallocENTRY(lines 1080 1082) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:53,998 INFO L401 ceAbstractionStarter]: For program point ldv_zallocFINAL(lines 1080 1082) no Hoare annotation was computed. [2018-01-23 14:47:53,998 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveFINAL(lines 1057 1061) no Hoare annotation was computed. [2018-01-23 14:47:53,998 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveErr0EnsuresViolation(lines 1057 1061) no Hoare annotation was computed. [2018-01-23 14:47:53,998 INFO L401 ceAbstractionStarter]: For program point L1059(lines 1059 1060) no Hoare annotation was computed. [2018-01-23 14:47:53,998 INFO L404 ceAbstractionStarter]: At program point ldv_nonpositiveENTRY(lines 1057 1061) the Hoare annotation is: true [2018-01-23 14:47:53,998 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveEXIT(lines 1057 1061) no Hoare annotation was computed. [2018-01-23 14:47:53,998 INFO L401 ceAbstractionStarter]: For program point L1441'(line 1441) no Hoare annotation was computed. [2018-01-23 14:47:53,999 INFO L404 ceAbstractionStarter]: At program point ldv_hid_get_drvdataENTRY(lines 1439 1442) the Hoare annotation is: true [2018-01-23 14:47:53,999 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataFINAL(lines 1439 1442) no Hoare annotation was computed. [2018-01-23 14:47:53,999 INFO L404 ceAbstractionStarter]: At program point L1441(line 1441) the Hoare annotation is: true [2018-01-23 14:47:53,999 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataErr0EnsuresViolation(lines 1439 1442) no Hoare annotation was computed. [2018-01-23 14:47:53,999 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataEXIT(lines 1439 1442) no Hoare annotation was computed. [2018-01-23 14:47:53,999 INFO L404 ceAbstractionStarter]: At program point ldv_dev_get_drvdataENTRY(lines 1191 1194) the Hoare annotation is: true [2018-01-23 14:47:53,999 INFO L401 ceAbstractionStarter]: For program point L1193(line 1193) no Hoare annotation was computed. [2018-01-23 14:47:53,999 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataEXIT(lines 1191 1194) no Hoare annotation was computed. [2018-01-23 14:47:53,999 INFO L401 ceAbstractionStarter]: For program point L1193'(line 1193) no Hoare annotation was computed. [2018-01-23 14:47:53,999 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataFINAL(lines 1191 1194) no Hoare annotation was computed. [2018-01-23 14:47:53,999 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataErr0EnsuresViolation(lines 1191 1194) no Hoare annotation was computed. [2018-01-23 14:47:53,999 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1535) the Hoare annotation is: true [2018-01-23 14:47:53,999 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,000 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1535) the Hoare annotation is: true [2018-01-23 14:47:54,000 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,000 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,000 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-23 14:47:54,000 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-01-23 14:47:54,000 INFO L404 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-01-23 14:47:54,000 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-01-23 14:47:54,000 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_probeENTRY(lines 1493 1502) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,000 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeErr0EnsuresViolation(lines 1493 1502) no Hoare annotation was computed. [2018-01-23 14:47:54,000 INFO L401 ceAbstractionStarter]: For program point L1495'(line 1495) no Hoare annotation was computed. [2018-01-23 14:47:54,000 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeFINAL(lines 1493 1502) no Hoare annotation was computed. [2018-01-23 14:47:54,000 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeEXIT(lines 1493 1502) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point L1496(lines 1496 1498) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L397 ceAbstractionStarter]: At program point L1497(line 1497) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,001 INFO L397 ceAbstractionStarter]: At program point L1495(line 1495) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point L1510(line 1510) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point L1516'(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point L1513''(line 1513) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1508 1531) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point L1516''(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point L1524'(line 1524) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point L1514'(line 1514) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point L1517(line 1517) no Hoare annotation was computed. [2018-01-23 14:47:54,001 INFO L401 ceAbstractionStarter]: For program point L1516(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:54,002 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1508 1531) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,002 INFO L397 ceAbstractionStarter]: At program point L1513(line 1513) the Hoare annotation is: false [2018-01-23 14:47:54,002 INFO L401 ceAbstractionStarter]: For program point L1514(line 1514) no Hoare annotation was computed. [2018-01-23 14:47:54,002 INFO L397 ceAbstractionStarter]: At program point L1511(line 1511) the Hoare annotation is: false [2018-01-23 14:47:54,002 INFO L401 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2018-01-23 14:47:54,002 INFO L401 ceAbstractionStarter]: For program point L1519(line 1519) no Hoare annotation was computed. [2018-01-23 14:47:54,002 INFO L397 ceAbstractionStarter]: At program point L1520(line 1520) the Hoare annotation is: false [2018-01-23 14:47:54,002 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1508 1531) no Hoare annotation was computed. [2018-01-23 14:47:54,003 INFO L397 ceAbstractionStarter]: At program point L1517'(line 1517) the Hoare annotation is: false [2018-01-23 14:47:54,003 INFO L401 ceAbstractionStarter]: For program point L1511'(line 1511) no Hoare annotation was computed. [2018-01-23 14:47:54,003 INFO L401 ceAbstractionStarter]: For program point L1513'(line 1513) no Hoare annotation was computed. [2018-01-23 14:47:54,003 INFO L404 ceAbstractionStarter]: At program point L1528(line 1528) the Hoare annotation is: true [2018-01-23 14:47:54,003 INFO L404 ceAbstractionStarter]: At program point L1526(line 1526) the Hoare annotation is: true [2018-01-23 14:47:54,003 INFO L401 ceAbstractionStarter]: For program point L1519'(lines 1519 1521) no Hoare annotation was computed. [2018-01-23 14:47:54,003 INFO L401 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2018-01-23 14:47:54,003 INFO L401 ceAbstractionStarter]: For program point L1516'''(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:54,003 INFO L404 ceAbstractionStarter]: At program point L1525(lines 1525 1526) the Hoare annotation is: true [2018-01-23 14:47:54,004 INFO L401 ceAbstractionStarter]: For program point L1523(lines 1523 1524) no Hoare annotation was computed. [2018-01-23 14:47:54,004 INFO L401 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2018-01-23 14:47:54,004 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-23 14:47:54,004 INFO L401 ceAbstractionStarter]: For program point L1455'(line 1455) no Hoare annotation was computed. [2018-01-23 14:47:54,004 INFO L404 ceAbstractionStarter]: At program point ldv_arvo_init_arvo_device_structENTRY(lines 1453 1458) the Hoare annotation is: true [2018-01-23 14:47:54,004 INFO L401 ceAbstractionStarter]: For program point L1456(line 1456) no Hoare annotation was computed. [2018-01-23 14:47:54,004 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structFINAL(lines 1453 1458) no Hoare annotation was computed. [2018-01-23 14:47:54,004 INFO L404 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: true [2018-01-23 14:47:54,004 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-23 14:47:54,005 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-23 14:47:54,005 INFO L401 ceAbstractionStarter]: For program point L1456'(line 1456) no Hoare annotation was computed. [2018-01-23 14:47:54,005 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-23 14:47:54,005 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structEXIT(lines 1453 1458) no Hoare annotation was computed. [2018-01-23 14:47:54,005 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structErr0EnsuresViolation(lines 1453 1458) no Hoare annotation was computed. [2018-01-23 14:47:54,007 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:54,008 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:54,008 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:54,008 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:54,008 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:54,008 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:54,008 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:54,008 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_arvo_removeErr0EnsuresViolation======== [2018-01-23 14:47:54,008 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-23 14:47:54,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:54,014 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:54,014 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_removeErr0EnsuresViolation]=== [2018-01-23 14:47:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash -509857275, now seen corresponding path program 1 times [2018-01-23 14:47:54,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:54,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:54,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:54,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:54,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:54,121 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:54,121 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-23 14:47:54,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:54,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:54,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:54,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-01-23 14:47:54,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:47:54,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:47:54,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:47:54,261 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2018-01-23 14:47:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:54,566 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2018-01-23 14:47:54,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:47:54,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2018-01-23 14:47:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:54,567 INFO L225 Difference]: With dead ends: 279 [2018-01-23 14:47:54,567 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:54,568 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:47:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:54,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:54,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:54,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:54,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-01-23 14:47:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:54,569 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:54,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:47:54,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:54,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:54,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-23 14:47:54,653 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1533 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1533 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1533 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1533 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point L1490(line 1490) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point L1486'(line 1486) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point L1486''(line 1486) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L397 ceAbstractionStarter]: At program point lvd_arvo_remove_specialsENTRY(lines 1483 1491) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point L1484'(line 1484) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsFINAL(lines 1483 1491) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point L1486(line 1486) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point L1489'(line 1489) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point L1484(line 1484) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L397 ceAbstractionStarter]: At program point L1489(line 1489) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsErr0EnsuresViolation(lines 1483 1491) no Hoare annotation was computed. [2018-01-23 14:47:54,654 INFO L401 ceAbstractionStarter]: For program point lvd_arvo_remove_specialsEXIT(lines 1483 1491) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L397 ceAbstractionStarter]: At program point L1505(line 1505) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,655 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_removeENTRY(lines 1504 1506) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeFINAL(lines 1504 1506) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeErr0EnsuresViolation(lines 1504 1506) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_removeEXIT(lines 1504 1506) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,655 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1535) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point L1463'(line 1463) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsErr0EnsuresViolation(lines 1460 1481) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point L1465'(line 1465) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsFINAL(lines 1460 1481) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_init_specialsENTRY(lines 1460 1481) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,656 INFO L397 ceAbstractionStarter]: At program point L1476(line 1476) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,656 INFO L397 ceAbstractionStarter]: At program point L1474(line 1474) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,656 INFO L397 ceAbstractionStarter]: At program point L1472(line 1472) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point L1473(lines 1473 1475) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point L1464''(line 1464) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point L1464'(line 1464) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point L1476'(line 1476) no Hoare annotation was computed. [2018-01-23 14:47:54,656 INFO L401 ceAbstractionStarter]: For program point L1472'(line 1472) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L397 ceAbstractionStarter]: At program point L1465(line 1465) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point L1463(line 1463) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point L1464(line 1464) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point L1468'(line 1468) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point L1469(lines 1469 1471) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L397 ceAbstractionStarter]: At program point L1468(line 1468) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_specialsEXIT(lines 1460 1481) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L404 ceAbstractionStarter]: At program point ldv_dev_set_drvdataENTRY(lines 1196 1199) the Hoare annotation is: true [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataEXIT(lines 1196 1199) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataFINAL(lines 1196 1199) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point ldv_dev_set_drvdataErr0EnsuresViolation(lines 1196 1199) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point L1198(line 1198) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L404 ceAbstractionStarter]: At program point ldv_hid_set_drvdataENTRY(lines 1444 1447) the Hoare annotation is: true [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataEXIT(lines 1444 1447) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataErr0EnsuresViolation(lines 1444 1447) no Hoare annotation was computed. [2018-01-23 14:47:54,657 INFO L404 ceAbstractionStarter]: At program point L1446(line 1446) the Hoare annotation is: true [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point ldv_hid_set_drvdataFINAL(lines 1444 1447) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point L1081(line 1081) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point L1081''(line 1081) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point ldv_zallocEXIT(lines 1080 1082) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point ldv_zallocErr0EnsuresViolation(lines 1080 1082) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L404 ceAbstractionStarter]: At program point L1081'(line 1081) the Hoare annotation is: true [2018-01-23 14:47:54,658 INFO L397 ceAbstractionStarter]: At program point ldv_zallocENTRY(lines 1080 1082) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point ldv_zallocFINAL(lines 1080 1082) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveFINAL(lines 1057 1061) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveErr0EnsuresViolation(lines 1057 1061) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point L1059(lines 1059 1060) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L404 ceAbstractionStarter]: At program point ldv_nonpositiveENTRY(lines 1057 1061) the Hoare annotation is: true [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point ldv_nonpositiveEXIT(lines 1057 1061) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L401 ceAbstractionStarter]: For program point L1441'(line 1441) no Hoare annotation was computed. [2018-01-23 14:47:54,658 INFO L404 ceAbstractionStarter]: At program point ldv_hid_get_drvdataENTRY(lines 1439 1442) the Hoare annotation is: true [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataFINAL(lines 1439 1442) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L404 ceAbstractionStarter]: At program point L1441(line 1441) the Hoare annotation is: true [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataErr0EnsuresViolation(lines 1439 1442) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point ldv_hid_get_drvdataEXIT(lines 1439 1442) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L404 ceAbstractionStarter]: At program point ldv_dev_get_drvdataENTRY(lines 1191 1194) the Hoare annotation is: true [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point L1193(line 1193) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataEXIT(lines 1191 1194) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point L1193'(line 1193) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataFINAL(lines 1191 1194) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point ldv_dev_get_drvdataErr0EnsuresViolation(lines 1191 1194) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1535) the Hoare annotation is: true [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 1535) the Hoare annotation is: true [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1535) no Hoare annotation was computed. [2018-01-23 14:47:54,659 INFO L404 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L404 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L397 ceAbstractionStarter]: At program point ldv_arvo_probeENTRY(lines 1493 1502) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeErr0EnsuresViolation(lines 1493 1502) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point L1495'(line 1495) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeFINAL(lines 1493 1502) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_probeEXIT(lines 1493 1502) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point L1496(lines 1496 1498) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L397 ceAbstractionStarter]: At program point L1497(line 1497) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,660 INFO L397 ceAbstractionStarter]: At program point L1495(line 1495) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point L1510(line 1510) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point L1516'(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point L1513''(line 1513) no Hoare annotation was computed. [2018-01-23 14:47:54,660 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1508 1531) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L401 ceAbstractionStarter]: For program point L1516''(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L401 ceAbstractionStarter]: For program point L1524'(line 1524) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L401 ceAbstractionStarter]: For program point L1514'(line 1514) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L401 ceAbstractionStarter]: For program point L1517(line 1517) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L401 ceAbstractionStarter]: For program point L1516(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1508 1531) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-23 14:47:54,661 INFO L397 ceAbstractionStarter]: At program point L1513(line 1513) the Hoare annotation is: false [2018-01-23 14:47:54,661 INFO L401 ceAbstractionStarter]: For program point L1514(line 1514) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L397 ceAbstractionStarter]: At program point L1511(line 1511) the Hoare annotation is: false [2018-01-23 14:47:54,661 INFO L401 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L401 ceAbstractionStarter]: For program point L1519(line 1519) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L397 ceAbstractionStarter]: At program point L1520(line 1520) the Hoare annotation is: false [2018-01-23 14:47:54,661 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1508 1531) no Hoare annotation was computed. [2018-01-23 14:47:54,661 INFO L397 ceAbstractionStarter]: At program point L1517'(line 1517) the Hoare annotation is: false [2018-01-23 14:47:54,662 INFO L401 ceAbstractionStarter]: For program point L1511'(line 1511) no Hoare annotation was computed. [2018-01-23 14:47:54,662 INFO L401 ceAbstractionStarter]: For program point L1513'(line 1513) no Hoare annotation was computed. [2018-01-23 14:47:54,662 INFO L404 ceAbstractionStarter]: At program point L1528(line 1528) the Hoare annotation is: true [2018-01-23 14:47:54,662 INFO L404 ceAbstractionStarter]: At program point L1526(line 1526) the Hoare annotation is: true [2018-01-23 14:47:54,662 INFO L401 ceAbstractionStarter]: For program point L1519'(lines 1519 1521) no Hoare annotation was computed. [2018-01-23 14:47:54,662 INFO L401 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2018-01-23 14:47:54,662 INFO L401 ceAbstractionStarter]: For program point L1516'''(line 1516) no Hoare annotation was computed. [2018-01-23 14:47:54,662 INFO L404 ceAbstractionStarter]: At program point L1525(lines 1525 1526) the Hoare annotation is: true [2018-01-23 14:47:54,662 INFO L401 ceAbstractionStarter]: For program point L1523(lines 1523 1524) no Hoare annotation was computed. [2018-01-23 14:47:54,662 INFO L401 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2018-01-23 14:47:54,662 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-23 14:47:54,662 INFO L401 ceAbstractionStarter]: For program point L1455'(line 1455) no Hoare annotation was computed. [2018-01-23 14:47:54,663 INFO L404 ceAbstractionStarter]: At program point ldv_arvo_init_arvo_device_structENTRY(lines 1453 1458) the Hoare annotation is: true [2018-01-23 14:47:54,663 INFO L401 ceAbstractionStarter]: For program point L1456(line 1456) no Hoare annotation was computed. [2018-01-23 14:47:54,663 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structFINAL(lines 1453 1458) no Hoare annotation was computed. [2018-01-23 14:47:54,663 INFO L404 ceAbstractionStarter]: At program point L1457(line 1457) the Hoare annotation is: true [2018-01-23 14:47:54,663 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-23 14:47:54,663 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-23 14:47:54,663 INFO L401 ceAbstractionStarter]: For program point L1456'(line 1456) no Hoare annotation was computed. [2018-01-23 14:47:54,663 INFO L401 ceAbstractionStarter]: For program point L1457'(line 1457) no Hoare annotation was computed. [2018-01-23 14:47:54,663 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structEXIT(lines 1453 1458) no Hoare annotation was computed. [2018-01-23 14:47:54,663 INFO L401 ceAbstractionStarter]: For program point ldv_arvo_init_arvo_device_structErr0EnsuresViolation(lines 1453 1458) no Hoare annotation was computed. [2018-01-23 14:47:54,664 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:54,664 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:54,664 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:54,665 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:54,665 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:54,665 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:54,665 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:54,665 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-23 14:47:54,665 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:54,666 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:54,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-23 14:47:54,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:54,667 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:54,667 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-23 14:47:54,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1044988527, now seen corresponding path program 1 times [2018-01-23 14:47:54,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:54,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:54,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,669 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:54,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:54,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:54,688 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-23 14:47:54,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:47:54,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:47:54,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:47:54,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:47:54,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:47:54,689 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-01-23 14:47:54,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:54,770 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2018-01-23 14:47:54,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:47:54,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-01-23 14:47:54,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:54,771 INFO L225 Difference]: With dead ends: 154 [2018-01-23 14:47:54,771 INFO L226 Difference]: Without dead ends: 21 [2018-01-23 14:47:54,772 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:47:54,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-01-23 14:47:54,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-01-23 14:47:54,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-01-23 14:47:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-01-23 14:47:54,775 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 10 [2018-01-23 14:47:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:54,775 INFO L432 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-01-23 14:47:54,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:47:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-01-23 14:47:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-23 14:47:54,776 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:54,776 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:54,776 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-23 14:47:54,776 INFO L82 PathProgramCache]: Analyzing trace with hash -788462575, now seen corresponding path program 1 times [2018-01-23 14:47:54,776 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:54,777 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:54,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,778 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:54,778 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:47:54,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:47:54,815 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:47:54,821 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:47:54,823 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:47:54,833 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:54,833 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:54,833 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:54,834 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:54,834 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:54,834 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:54,834 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:54,834 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-23 14:47:54,834 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:54,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-23 14:47:54,835 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:54,835 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-23 14:47:54,835 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-23 14:47:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash 232304, now seen corresponding path program 1 times [2018-01-23 14:47:54,836 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:54,836 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:54,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,837 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:54,837 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:47:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:47:54,842 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:47:54,843 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:47:54,844 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:54,844 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:54,844 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:54,844 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:54,844 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:54,844 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:54,844 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:54,844 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_arvo_init_specialsErr0EnsuresViolation======== [2018-01-23 14:47:54,844 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:54,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-23 14:47:54,848 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:54,848 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:54,848 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_init_specialsErr0EnsuresViolation]=== [2018-01-23 14:47:54,848 INFO L82 PathProgramCache]: Analyzing trace with hash -66861931, now seen corresponding path program 1 times [2018-01-23 14:47:54,848 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:54,848 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:54,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,850 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:54,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:54,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:54,912 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:54,912 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-23 14:47:54,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:54,956 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:54,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:54,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:54,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-01-23 14:47:54,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:47:54,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:47:54,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:47:54,989 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2018-01-23 14:47:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:55,208 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2018-01-23 14:47:55,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:47:55,209 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-01-23 14:47:55,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:55,210 INFO L225 Difference]: With dead ends: 279 [2018-01-23 14:47:55,210 INFO L226 Difference]: Without dead ends: 74 [2018-01-23 14:47:55,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:47:55,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-23 14:47:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-23 14:47:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-23 14:47:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-01-23 14:47:55,216 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 54 [2018-01-23 14:47:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:55,217 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-01-23 14:47:55,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:47:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-01-23 14:47:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-01-23 14:47:55,218 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:55,218 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:47:55,218 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_arvo_init_specialsErr0EnsuresViolation]=== [2018-01-23 14:47:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1740034391, now seen corresponding path program 1 times [2018-01-23 14:47:55,218 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:55,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:55,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:55,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:55,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:55,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:47:55,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:55,296 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-23 14:47:55,301 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:55,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:55,350 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:55,356 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc2.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc2.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0))) is different from true [2018-01-23 14:47:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:47:55,394 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:55,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:47:55,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:55,395 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:55,395 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-23 14:47:55,395 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 5 states. [2018-01-23 14:47:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:55,415 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-23 14:47:55,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:47:55,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2018-01-23 14:47:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:55,416 INFO L225 Difference]: With dead ends: 81 [2018-01-23 14:47:55,416 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:55,416 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-23 14:47:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:55,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:55,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2018-01-23 14:47:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:55,417 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:55,417 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:55,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:55,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:55,419 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:55,419 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:55,419 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:55,419 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:55,419 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:55,419 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:55,419 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:55,419 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_dev_set_drvdataErr0EnsuresViolation======== [2018-01-23 14:47:55,420 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-23 14:47:55,421 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:55,421 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:55,421 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_dev_set_drvdataErr0EnsuresViolation]=== [2018-01-23 14:47:55,422 INFO L82 PathProgramCache]: Analyzing trace with hash -429635641, now seen corresponding path program 1 times [2018-01-23 14:47:55,422 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:55,422 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:55,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:55,423 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:55,423 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:55,430 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:55,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:55,463 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-23 14:47:55,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:55,511 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:55,550 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:55,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-23 14:47:55,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:55,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:55,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:55,552 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-23 14:47:55,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:55,586 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-23 14:47:55,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:47:55,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-01-23 14:47:55,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:55,587 INFO L225 Difference]: With dead ends: 280 [2018-01-23 14:47:55,587 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:55,588 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:55,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:55,589 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-23 14:47:55,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:55,589 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:55,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:55,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:55,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:55,593 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:55,593 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:55,593 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:55,593 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:55,593 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:55,593 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:55,594 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:55,594 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_hid_set_drvdataErr0EnsuresViolation======== [2018-01-23 14:47:55,594 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:55,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-23 14:47:55,598 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:55,598 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:55,598 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_hid_set_drvdataErr0EnsuresViolation]=== [2018-01-23 14:47:55,598 INFO L82 PathProgramCache]: Analyzing trace with hash -562985946, now seen corresponding path program 1 times [2018-01-23 14:47:55,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:55,599 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:55,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:55,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:55,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:55,610 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:55,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:55,681 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-23 14:47:55,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:55,735 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:55,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:55,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:55,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-23 14:47:55,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:55,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:55,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:55,776 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-23 14:47:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:55,816 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-23 14:47:55,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:47:55,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-23 14:47:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:55,817 INFO L225 Difference]: With dead ends: 280 [2018-01-23 14:47:55,817 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:55,818 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:55,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:55,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:55,819 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-01-23 14:47:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:55,819 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:55,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:55,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:55,821 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:55,821 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:55,821 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:55,821 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:55,821 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:55,822 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:55,822 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:55,822 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_zallocErr0EnsuresViolation======== [2018-01-23 14:47:55,822 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:55,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-23 14:47:55,825 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:55,825 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:55,825 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_zallocErr0EnsuresViolation]=== [2018-01-23 14:47:55,825 INFO L82 PathProgramCache]: Analyzing trace with hash -48449455, now seen corresponding path program 1 times [2018-01-23 14:47:55,825 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:55,825 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:55,826 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:55,826 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:55,827 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:55,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:55,876 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:55,876 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-23 14:47:55,885 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:55,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:47:55,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:55,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-01-23 14:47:55,958 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:55,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:55,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:55,959 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-23 14:47:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:55,983 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-23 14:47:55,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:47:55,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-01-23 14:47:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:55,985 INFO L225 Difference]: With dead ends: 280 [2018-01-23 14:47:55,985 INFO L226 Difference]: Without dead ends: 50 [2018-01-23 14:47:55,986 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-23 14:47:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-23 14:47:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-23 14:47:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-23 14:47:55,992 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 53 [2018-01-23 14:47:55,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:55,992 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-23 14:47:55,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:55,992 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-23 14:47:55,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-23 14:47:55,993 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:55,993 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 14:47:55,993 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_zallocErr0EnsuresViolation]=== [2018-01-23 14:47:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash 319882607, now seen corresponding path program 1 times [2018-01-23 14:47:55,993 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:55,993 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:55,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:55,994 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:55,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-23 14:47:56,023 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:56,023 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-23 14:47:56,041 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:56,095 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc2.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc2.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0))) is different from true [2018-01-23 14:47:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-23 14:47:56,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:56,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:47:56,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:56,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:56,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-23 14:47:56,128 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-23 14:47:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:56,200 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2018-01-23 14:47:56,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:47:56,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-01-23 14:47:56,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:56,201 INFO L225 Difference]: With dead ends: 57 [2018-01-23 14:47:56,201 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:56,201 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-23 14:47:56,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:56,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:56,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2018-01-23 14:47:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:56,202 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:56,202 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:56,202 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:56,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:56,203 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:56,204 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:56,204 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:56,204 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:56,204 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:56,204 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:56,204 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:56,204 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_nonpositiveErr0EnsuresViolation======== [2018-01-23 14:47:56,204 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-23 14:47:56,206 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:56,206 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:56,206 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_nonpositiveErr0EnsuresViolation]=== [2018-01-23 14:47:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash -205702625, now seen corresponding path program 1 times [2018-01-23 14:47:56,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:56,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:56,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:56,270 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:56,270 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-23 14:47:56,283 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:56,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:56,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-23 14:47:56,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:56,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:56,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:56,365 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-23 14:47:56,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:56,386 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-23 14:47:56,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:47:56,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-01-23 14:47:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:56,387 INFO L225 Difference]: With dead ends: 280 [2018-01-23 14:47:56,387 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:56,388 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:56,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:56,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:56,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:56,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2018-01-23 14:47:56,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:56,389 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:56,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:56,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:56,392 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:56,392 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:56,392 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:56,392 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:56,392 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:56,392 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:56,392 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:56,392 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_hid_get_drvdataErr0EnsuresViolation======== [2018-01-23 14:47:56,392 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:56,394 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-01-23 14:47:56,396 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:56,396 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:56,396 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_hid_get_drvdataErr0EnsuresViolation]=== [2018-01-23 14:47:56,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1619559385, now seen corresponding path program 1 times [2018-01-23 14:47:56,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:56,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:56,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:56,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:56,470 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-23 14:47:56,479 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,518 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:56,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:56,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-23 14:47:56,549 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:56,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:56,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:56,549 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-23 14:47:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:56,568 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-23 14:47:56,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:47:56,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2018-01-23 14:47:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:56,592 INFO L225 Difference]: With dead ends: 280 [2018-01-23 14:47:56,592 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:56,593 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:56,593 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2018-01-23 14:47:56,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:56,594 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:56,594 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:56,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:56,596 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:56,596 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:56,596 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:56,596 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:56,596 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:56,596 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:56,596 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:56,596 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_dev_get_drvdataErr0EnsuresViolation======== [2018-01-23 14:47:56,596 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-01-23 14:47:56,600 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:56,600 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:56,600 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_dev_get_drvdataErr0EnsuresViolation]=== [2018-01-23 14:47:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1006649024, now seen corresponding path program 1 times [2018-01-23 14:47:56,600 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:56,601 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:56,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,602 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,611 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:56,664 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:56,664 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-23 14:47:56,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:56,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:56,744 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:56,744 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-23 14:47:56,744 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:56,745 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:56,745 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:56,745 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-23 14:47:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:56,780 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-23 14:47:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:47:56,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2018-01-23 14:47:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:56,782 INFO L225 Difference]: With dead ends: 280 [2018-01-23 14:47:56,782 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:56,782 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:56,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:56,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:56,783 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2018-01-23 14:47:56,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:56,783 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:56,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:56,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:56,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:56,785 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:56,785 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:56,785 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:56,785 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:56,785 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:56,785 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:56,785 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:56,786 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-23 14:47:56,786 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-23 14:47:56,787 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:56,787 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:56,787 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-23 14:47:56,787 INFO L82 PathProgramCache]: Analyzing trace with hash 298466484, now seen corresponding path program 1 times [2018-01-23 14:47:56,787 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:56,787 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:56,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,788 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,788 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:47:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-23 14:47:56,800 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-23 14:47:56,801 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:47:56,802 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:47:56,803 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:47:56,803 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:47:56,803 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-23 14:47:56,806 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:56,806 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:56,806 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:56,806 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:56,806 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:56,806 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:56,806 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:56,807 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_arvo_probeErr0EnsuresViolation======== [2018-01-23 14:47:56,807 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:56,808 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:56,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-23 14:47:56,809 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:56,809 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:56,809 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_probeErr0EnsuresViolation]=== [2018-01-23 14:47:56,809 INFO L82 PathProgramCache]: Analyzing trace with hash 352036426, now seen corresponding path program 1 times [2018-01-23 14:47:56,809 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:56,809 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:56,810 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,810 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,811 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:56,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:56,873 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:47:56,883 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:56,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:56,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:56,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2018-01-23 14:47:56,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-23 14:47:56,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-23 14:47:56,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-23 14:47:56,964 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 6 states. [2018-01-23 14:47:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:57,266 INFO L93 Difference]: Finished difference Result 279 states and 321 transitions. [2018-01-23 14:47:57,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-23 14:47:57,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-01-23 14:47:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:57,267 INFO L225 Difference]: With dead ends: 279 [2018-01-23 14:47:57,267 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:57,268 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:47:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:57,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-01-23 14:47:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:57,269 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:57,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-23 14:47:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:57,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:57,271 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:57,271 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:57,271 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:57,271 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:57,271 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:57,271 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:57,271 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:57,271 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-23 14:47:57,271 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:57,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-23 14:47:57,274 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:57,274 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:57,274 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-23 14:47:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1707362669, now seen corresponding path program 1 times [2018-01-23 14:47:57,274 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:57,274 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:57,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:57,276 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:57,276 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:57,281 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:57,298 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-23 14:47:57,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-23 14:47:57,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-23 14:47:57,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-23 14:47:57,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-23 14:47:57,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:47:57,299 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 3 states. [2018-01-23 14:47:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:57,371 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2018-01-23 14:47:57,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-23 14:47:57,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-23 14:47:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:57,373 INFO L225 Difference]: With dead ends: 154 [2018-01-23 14:47:57,373 INFO L226 Difference]: Without dead ends: 129 [2018-01-23 14:47:57,373 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-23 14:47:57,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-23 14:47:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2018-01-23 14:47:57,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-23 14:47:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2018-01-23 14:47:57,382 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 14 [2018-01-23 14:47:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:57,383 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2018-01-23 14:47:57,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-23 14:47:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2018-01-23 14:47:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-23 14:47:57,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:57,384 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:57,384 INFO L371 AbstractCegarLoop]: === Iteration 2 === [entry_pointErr0EnsuresViolation]=== [2018-01-23 14:47:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2053518524, now seen corresponding path program 1 times [2018-01-23 14:47:57,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:57,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:57,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:57,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:57,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:57,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:47:57,425 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:57,426 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:47:57,431 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:57,443 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:57,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-23 14:47:57,490 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-23 14:47:57,490 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-01-23 14:47:57,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-23 14:47:57,491 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-23 14:47:57,491 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:47:57,491 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 9 states. [2018-01-23 14:47:57,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:57,510 INFO L93 Difference]: Finished difference Result 243 states and 270 transitions. [2018-01-23 14:47:57,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:47:57,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-23 14:47:57,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:57,513 INFO L225 Difference]: With dead ends: 243 [2018-01-23 14:47:57,513 INFO L226 Difference]: Without dead ends: 126 [2018-01-23 14:47:57,514 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-23 14:47:57,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-23 14:47:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-23 14:47:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-23 14:47:57,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-01-23 14:47:57,523 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 22 [2018-01-23 14:47:57,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:57,523 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-01-23 14:47:57,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-23 14:47:57,524 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-01-23 14:47:57,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-23 14:47:57,524 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:57,524 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:57,525 INFO L371 AbstractCegarLoop]: === Iteration 3 === [entry_pointErr0EnsuresViolation]=== [2018-01-23 14:47:57,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1956784614, now seen corresponding path program 1 times [2018-01-23 14:47:57,525 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:57,525 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:57,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:57,526 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:57,526 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:57,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-23 14:47:57,553 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:57,553 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:47:57,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:57,585 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:57,590 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc2.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |ldv_malloc_#t~malloc2.base| 1)) (<= (select |c_old(#valid)| |ldv_malloc_#t~malloc2.base|) 0))) is different from true [2018-01-23 14:47:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-01-23 14:47:57,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:57,618 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-01-23 14:47:57,619 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:57,619 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:57,619 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2018-01-23 14:47:57,619 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 5 states. [2018-01-23 14:47:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:57,641 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2018-01-23 14:47:57,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-23 14:47:57,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-23 14:47:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:57,641 INFO L225 Difference]: With dead ends: 133 [2018-01-23 14:47:57,641 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:57,642 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2018-01-23 14:47:57,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:57,642 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-23 14:47:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:57,642 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:57,642 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:57,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:57,644 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-23 14:47:57,644 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-23 14:47:57,644 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-23 14:47:57,644 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-23 14:47:57,644 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-23 14:47:57,644 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-23 14:47:57,644 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-23 14:47:57,644 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_arvo_init_arvo_device_structErr0EnsuresViolation======== [2018-01-23 14:47:57,644 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-23 14:47:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states. [2018-01-23 14:47:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-01-23 14:47:57,647 INFO L314 BasicCegarLoop]: Found error trace [2018-01-23 14:47:57,648 INFO L322 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-23 14:47:57,648 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_arvo_init_arvo_device_structErr0EnsuresViolation]=== [2018-01-23 14:47:57,648 INFO L82 PathProgramCache]: Analyzing trace with hash 831609464, now seen corresponding path program 1 times [2018-01-23 14:47:57,648 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-23 14:47:57,648 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-23 14:47:57,649 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:57,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:57,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-23 14:47:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:57,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-23 14:47:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-01-23 14:47:57,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-23 14:47:57,699 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-23 14:47:57,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-23 14:47:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-23 14:47:57,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-23 14:47:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-23 14:47:57,801 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-23 14:47:57,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 5 [2018-01-23 14:47:57,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-23 14:47:57,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-23 14:47:57,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:57,802 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 5 states. [2018-01-23 14:47:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-23 14:47:57,833 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2018-01-23 14:47:57,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-23 14:47:57,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-01-23 14:47:57,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-23 14:47:57,835 INFO L225 Difference]: With dead ends: 280 [2018-01-23 14:47:57,836 INFO L226 Difference]: Without dead ends: 0 [2018-01-23 14:47:57,837 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-23 14:47:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-23 14:47:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-23 14:47:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-23 14:47:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-23 14:47:57,838 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2018-01-23 14:47:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-23 14:47:57,838 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-23 14:47:57,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-23 14:47:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-23 14:47:57,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-23 14:47:57,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 02:47:57 BoogieIcfgContainer [2018-01-23 14:47:57,844 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-23 14:47:57,845 INFO L168 Benchmark]: Toolchain (without parser) took 6536.84 ms. Allocated memory was 307.8 MB in the beginning and 554.7 MB in the end (delta: 246.9 MB). Free memory was 266.7 MB in the beginning and 393.3 MB in the end (delta: -126.6 MB). Peak memory consumption was 120.3 MB. Max. memory is 5.3 GB. [2018-01-23 14:47:57,846 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 307.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-23 14:47:57,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.91 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 252.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. [2018-01-23 14:47:57,847 INFO L168 Benchmark]: Boogie Preprocessor took 46.12 ms. Allocated memory is still 307.8 MB. Free memory was 252.3 MB in the beginning and 249.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-23 14:47:57,847 INFO L168 Benchmark]: RCFGBuilder took 534.21 ms. Allocated memory is still 307.8 MB. Free memory was 249.4 MB in the beginning and 213.2 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 5.3 GB. [2018-01-23 14:47:57,848 INFO L168 Benchmark]: TraceAbstraction took 5723.11 ms. Allocated memory was 307.8 MB in the beginning and 554.7 MB in the end (delta: 246.9 MB). Free memory was 213.2 MB in the beginning and 393.3 MB in the end (delta: -180.1 MB). Peak memory consumption was 66.8 MB. Max. memory is 5.3 GB. [2018-01-23 14:47:57,850 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.26 ms. Allocated memory is still 307.8 MB. Free memory is still 273.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 227.91 ms. Allocated memory is still 307.8 MB. Free memory was 266.7 MB in the beginning and 252.3 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.12 ms. Allocated memory is still 307.8 MB. Free memory was 252.3 MB in the beginning and 249.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 534.21 ms. Allocated memory is still 307.8 MB. Free memory was 249.4 MB in the beginning and 213.2 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5723.11 ms. Allocated memory was 307.8 MB in the beginning and 554.7 MB in the end (delta: 246.9 MB). Free memory was 213.2 MB in the beginning and 393.3 MB in the end (delta: -180.1 MB). Peak memory consumption was 66.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1533]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.7s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 83 SDslu, 4 SDs, 0 SdLazy, 49 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 43 PreInvPairs, 46 NumberOfFragments, 83 HoareAnnotationTreeSize, 43 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 555 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1483]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: lvd_arvo_remove_specialsErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 1.1s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 126 SDtfs, 88 SDslu, 267 SDs, 0 SdLazy, 251 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 169 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 73 PreInvPairs, 79 NumberOfFragments, 47 HoareAnnotationTreeSize, 73 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 314 NumberOfCodeBlocks, 314 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 310 ConstructedInterpolants, 2 QuantifiedInterpolants, 30480 SizeOfPredicates, 3 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 36/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1504]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_arvo_removeErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.6s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 84 SDslu, 263 SDs, 0 SdLazy, 237 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 73 PreInvPairs, 83 NumberOfFragments, 83 HoareAnnotationTreeSize, 73 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 13680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 307 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1534] CALL entry_point() [L1509] CALL ldv_malloc(sizeof(struct ldv_hid_device)) VAL [\old(size)=12] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=12, malloc(size)={14:0}, size=12] [L1074] return malloc(size); VAL [\old(size)=12, \result={14:0}, malloc(size)={14:0}, size=12] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 118 SDtfs, 87 SDslu, 4 SDs, 0 SdLazy, 49 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1460]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_arvo_init_specialsErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.5s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 126 SDtfs, 87 SDslu, 267 SDs, 0 SdLazy, 251 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 262 ConstructedInterpolants, 2 QuantifiedInterpolants, 23288 SizeOfPredicates, 3 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 36/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1196]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_dev_set_drvdataErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 5760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 241 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1444]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_hid_set_drvdataErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 6200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 243 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1080]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_zallocErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.3s OverallTime, 2 OverallIterations, 3 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 160 SDtfs, 6 SDslu, 449 SDs, 0 SdLazy, 25 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 212 ConstructedInterpolants, 2 QuantifiedInterpolants, 16004 SizeOfPredicates, 5 NumberOfNonLiveVariables, 484 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 36/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1057]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_nonpositiveErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 10586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1439]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_hid_get_drvdataErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 160 NumberOfCodeBlocks, 160 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 14378 SizeOfPredicates, 0 NumberOfNonLiveVariables, 341 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1191]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_dev_get_drvdataErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 13376 SizeOfPredicates, 0 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1534] CALL entry_point() [L1509] CALL, EXPR ldv_malloc(sizeof(struct ldv_hid_device)) VAL [\old(size)=12] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=12, \result={0:0}, size=12] [L1509] EXPR ldv_malloc(sizeof(struct ldv_hid_device)) VAL [ldv_malloc(sizeof(struct ldv_hid_device))={0:0}] [L1509] struct ldv_hid_device *hdev = (struct ldv_hid_device *)ldv_malloc(sizeof(struct ldv_hid_device)); [L1510] COND TRUE, RET !hdev VAL [hdev={0:0}] [L1534] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1493]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_arvo_probeErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.4s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 116 SDtfs, 81 SDslu, 263 SDs, 0 SdLazy, 237 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 9576 SizeOfPredicates, 0 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1508]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: entry_pointErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 264 SDtfs, 86 SDslu, 813 SDs, 0 SdLazy, 80 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 106 NumberOfCodeBlocks, 106 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 101 ConstructedInterpolants, 2 QuantifiedInterpolants, 4207 SizeOfPredicates, 4 NumberOfNonLiveVariables, 212 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 8/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1453]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_arvo_init_arvo_device_structErr0EnsuresViolation CFG has 17 procedures, 144 locations, 16 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 3 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 4 SDslu, 445 SDs, 0 SdLazy, 11 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=0, 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.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 11480 SizeOfPredicates, 0 NumberOfNonLiveVariables, 296 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 20/24 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 1525]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1526]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1474]: Loop Invariant Derived loop invariant: \valid == \old(\valid) - InvariantResult [Line: 1528]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1497]: Loop Invariant Derived loop invariant: \valid == \old(\valid) RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-9-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-10-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-11-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-12-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-13-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-14-2018-01-23_14-47-57-865.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test15_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-15-2018-01-23_14-47-57-865.csv Received shutdown request...