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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 23:35:08,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 23:35:08,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 23:35:08,465 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 23:35:08,465 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 23:35:08,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 23:35:08,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 23:35:08,469 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 23:35:08,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 23:35:08,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 23:35:08,473 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 23:35:08,473 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 23:35:08,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 23:35:08,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 23:35:08,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 23:35:08,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 23:35:08,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 23:35:08,482 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 23:35:08,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 23:35:08,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 23:35:08,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 23:35:08,487 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 23:35:08,488 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 23:35:08,489 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 23:35:08,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 23:35:08,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 23:35:08,491 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 23:35:08,492 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 23:35:08,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 23:35:08,492 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 23:35:08,493 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 23:35:08,493 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 23:35:08,501 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 23:35:08,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 23:35:08,502 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 23:35:08,502 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 23:35:08,502 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 23:35:08,502 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 23:35:08,503 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 23:35:08,503 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 23:35:08,503 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 23:35:08,503 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 23:35:08,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 23:35:08,503 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 23:35:08,504 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 23:35:08,504 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 23:35:08,504 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 23:35:08,504 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 23:35:08,504 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 23:35:08,504 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 23:35:08,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 23:35:08,504 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 23:35:08,505 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 23:35:08,505 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 23:35:08,505 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 23:35:08,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 23:35:08,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 23:35:08,506 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 23:35:08,506 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 23:35:08,506 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 23:35:08,506 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 23:35:08,506 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 23:35:08,506 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 23:35:08,506 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 23:35:08,507 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 23:35:08,507 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 23:35:08,542 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 23:35:08,551 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 23:35:08,555 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 23:35:08,556 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 23:35:08,557 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 23:35:08,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 23:35:08,719 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 23:35:08,725 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-01-28 23:35:08,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 23:35:08,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 23:35:08,731 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 23:35:08,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:35:08" (1/1) ... [2018-01-28 23:35:08,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67990aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08, skipping insertion in model container [2018-01-28 23:35:08,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 11:35:08" (1/1) ... [2018-01-28 23:35:08,748 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:35:08,784 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 23:35:08,896 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:35:08,912 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 23:35:08,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08 WrapperNode [2018-01-28 23:35:08,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 23:35:08,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 23:35:08,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 23:35:08,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 23:35:08,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08" (1/1) ... [2018-01-28 23:35:08,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08" (1/1) ... [2018-01-28 23:35:08,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08" (1/1) ... [2018-01-28 23:35:08,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08" (1/1) ... [2018-01-28 23:35:08,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08" (1/1) ... [2018-01-28 23:35:08,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08" (1/1) ... [2018-01-28 23:35:08,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08" (1/1) ... [2018-01-28 23:35:08,961 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 23:35:08,962 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 23:35:08,962 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 23:35:08,962 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 23:35:08,963 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08" (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-28 23:35:09,024 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 23:35:09,025 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 23:35:09,025 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-01-28 23:35:09,025 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 23:35:09,025 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 23:35:09,025 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 23:35:09,025 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 23:35:09,025 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 23:35:09,025 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 23:35:09,025 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 23:35:09,026 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-01-28 23:35:09,026 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 23:35:09,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 23:35:09,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 23:35:09,277 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 23:35:09,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:09 BoogieIcfgContainer [2018-01-28 23:35:09,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 23:35:09,278 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-01-28 23:35:09,278 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-01-28 23:35:09,279 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-01-28 23:35:09,281 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:09" (1/1) ... [2018-01-28 23:35:09,287 INFO L103 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-01-28 23:35:09,288 INFO L104 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-01-28 23:35:09,288 INFO L150 apSepIcfgTransformer]: starting freeze-var-style preprocessing [2018-01-28 23:35:09,349 INFO L218 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-01-28 23:35:09,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-28 23:35:49,761 INFO L311 AbstractInterpreter]: Visited 89 different actions 634 times. Merged at 57 different actions 363 times. Never widened. Found 39 fixpoints after 11 different actions. Largest state had 44 variables. [2018-01-28 23:35:49,764 INFO L226 apSepIcfgTransformer]: finished equality analysis [2018-01-28 23:35:49,792 INFO L244 HeapSepPreAnalysis]: Number of read from array group [#memory_int] : 4 [2018-01-28 23:35:49,793 INFO L238 apSepIcfgTransformer]: Finished pre analysis before partitioning [2018-01-28 23:35:49,793 INFO L239 apSepIcfgTransformer]: array groups: Set: [#memory_int] [2018-01-28 23:35:49,793 INFO L241 apSepIcfgTransformer]: select infos: Set: ((select |v_#memory_int_5| |v_cstrncpy_#t~post6.base_3|), at (SUMMARY for call write~int(0, #t~post6.base, #t~post6.offset, 1); srcloc: L549'')) ((select (select |v_#memory_int_1| |v_cstrncpy_#t~post2.base_3|) |v_cstrncpy_#t~post2.offset_3|), at (SUMMARY for call #t~mem4 := read~int(#t~post2.base, #t~post2.offset, 1); srcloc: L547'''')) ((select |v_#memory_int_9| v_main_~nondetString~6.base_2), at (SUMMARY for call write~int(0, ~nondetString~6.base, ~nondetString~6.offset + (~length~6 - 1) * 1, 1); srcloc: L567)) ((select |v_#memory_int_3| |v_cstrncpy_#t~post1.base_3|), at (SUMMARY for call write~int(#t~mem4, #t~post1.base, #t~post1.offset, 1); srcloc: L547''''')) [2018-01-28 23:35:49,808 INFO L544 PartitionManager]: partitioning result: [2018-01-28 23:35:49,808 INFO L549 PartitionManager]: location blocks for array group [#memory_int] [2018-01-28 23:35:49,808 INFO L558 PartitionManager]: at dimension 0 [2018-01-28 23:35:49,809 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:35:49,809 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:35:49,809 INFO L558 PartitionManager]: at dimension 1 [2018-01-28 23:35:49,809 INFO L559 PartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-01-28 23:35:49,809 INFO L560 PartitionManager]: # location blocks :1 [2018-01-28 23:35:49,914 INFO L86 ransitionTransformer]: executing heap partitioning transformation [2018-01-28 23:35:49,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:35:49 BasicIcfg [2018-01-28 23:35:49,929 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-01-28 23:35:49,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 23:35:49,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 23:35:49,932 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 23:35:49,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 11:35:08" (1/4) ... [2018-01-28 23:35:49,933 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba25483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:35:49, skipping insertion in model container [2018-01-28 23:35:49,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 11:35:08" (2/4) ... [2018-01-28 23:35:49,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba25483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 11:35:49, skipping insertion in model container [2018-01-28 23:35:49,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 11:35:09" (3/4) ... [2018-01-28 23:35:49,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba25483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:35:49, skipping insertion in model container [2018-01-28 23:35:49,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.01 11:35:49" (4/4) ... [2018-01-28 23:35:49,936 INFO L107 eAbstractionObserver]: Analyzing ICFG HeapSeparatedIcfg [2018-01-28 23:35:49,943 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 23:35:49,949 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-28 23:35:49,981 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 23:35:49,981 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 23:35:49,981 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 23:35:49,981 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 23:35:49,981 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 23:35:49,982 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 23:35:49,982 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 23:35:49,982 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 23:35:49,983 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 23:35:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-01-28 23:35:49,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:35:49,999 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:50,000 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:50,000 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash 624907710, now seen corresponding path program 1 times [2018-01-28 23:35:50,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:50,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:50,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:50,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:50,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:50,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:50,178 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-28 23:35:50,180 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:50,181 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 23:35:50,182 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 23:35:50,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 23:35:50,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 23:35:50,191 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 4 states. [2018-01-28 23:35:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:50,303 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2018-01-28 23:35:50,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 23:35:50,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-28 23:35:50,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:50,315 INFO L225 Difference]: With dead ends: 93 [2018-01-28 23:35:50,315 INFO L226 Difference]: Without dead ends: 75 [2018-01-28 23:35:50,318 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:35:50,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-28 23:35:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-28 23:35:50,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 23:35:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-01-28 23:35:50,350 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 15 [2018-01-28 23:35:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:50,351 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-01-28 23:35:50,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 23:35:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-01-28 23:35:50,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-28 23:35:50,351 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:50,352 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:50,352 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:50,352 INFO L82 PathProgramCache]: Analyzing trace with hash 624907712, now seen corresponding path program 1 times [2018-01-28 23:35:50,352 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:50,352 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:50,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:50,353 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:50,353 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:50,369 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:50,544 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-28 23:35:50,545 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:50,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:35:50,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:35:50,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:35:50,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:35:50,547 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2018-01-28 23:35:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:50,608 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-01-28 23:35:50,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:35:50,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-28 23:35:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:50,610 INFO L225 Difference]: With dead ends: 75 [2018-01-28 23:35:50,610 INFO L226 Difference]: Without dead ends: 74 [2018-01-28 23:35:50,611 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:35:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-28 23:35:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-28 23:35:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-28 23:35:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2018-01-28 23:35:50,619 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 15 [2018-01-28 23:35:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:50,620 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2018-01-28 23:35:50,620 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:35:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2018-01-28 23:35:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 23:35:50,621 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:50,621 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:50,622 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2083061586, now seen corresponding path program 1 times [2018-01-28 23:35:50,622 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:50,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:50,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:50,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:50,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:50,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:50,788 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-28 23:35:50,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:50,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 23:35:50,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 23:35:50,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 23:35:50,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 23:35:50,789 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 6 states. [2018-01-28 23:35:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:51,049 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-01-28 23:35:51,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 23:35:51,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-28 23:35:51,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:51,051 INFO L225 Difference]: With dead ends: 74 [2018-01-28 23:35:51,051 INFO L226 Difference]: Without dead ends: 61 [2018-01-28 23:35:51,051 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 23:35:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-28 23:35:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-28 23:35:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-28 23:35:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-28 23:35:51,058 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 23 [2018-01-28 23:35:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:51,058 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-28 23:35:51,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 23:35:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-28 23:35:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 23:35:51,059 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:51,059 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:51,059 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash 177740795, now seen corresponding path program 1 times [2018-01-28 23:35:51,060 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:51,060 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:51,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:51,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:51,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:51,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:51,226 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-28 23:35:51,226 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:51,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 23:35:51,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 23:35:51,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 23:35:51,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:35:51,227 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 10 states. [2018-01-28 23:35:51,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:51,400 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-01-28 23:35:51,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 23:35:51,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-01-28 23:35:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:51,401 INFO L225 Difference]: With dead ends: 77 [2018-01-28 23:35:51,402 INFO L226 Difference]: Without dead ends: 76 [2018-01-28 23:35:51,402 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-28 23:35:51,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-28 23:35:51,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2018-01-28 23:35:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-28 23:35:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-28 23:35:51,407 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 28 [2018-01-28 23:35:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:51,408 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-28 23:35:51,408 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 23:35:51,408 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-28 23:35:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-28 23:35:51,408 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:51,409 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:51,409 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash 177740793, now seen corresponding path program 1 times [2018-01-28 23:35:51,409 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:51,409 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:51,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:51,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:51,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:51,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:51,485 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-28 23:35:51,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:51,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 23:35:51,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 23:35:51,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 23:35:51,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:35:51,486 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 7 states. [2018-01-28 23:35:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:51,610 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-01-28 23:35:51,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 23:35:51,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-28 23:35:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:51,611 INFO L225 Difference]: With dead ends: 67 [2018-01-28 23:35:51,611 INFO L226 Difference]: Without dead ends: 66 [2018-01-28 23:35:51,611 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:35:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-28 23:35:51,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-01-28 23:35:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-28 23:35:51,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-01-28 23:35:51,618 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 28 [2018-01-28 23:35:51,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:51,618 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-01-28 23:35:51,618 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 23:35:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-01-28 23:35:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 23:35:51,619 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:51,619 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:51,620 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:51,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1214997694, now seen corresponding path program 1 times [2018-01-28 23:35:51,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:51,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:51,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:51,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:51,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:51,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:51,776 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-28 23:35:51,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:51,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-28 23:35:51,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-28 23:35:51,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-28 23:35:51,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-01-28 23:35:51,777 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 14 states. [2018-01-28 23:35:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:52,058 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-28 23:35:52,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 23:35:52,059 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-01-28 23:35:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:52,060 INFO L225 Difference]: With dead ends: 69 [2018-01-28 23:35:52,060 INFO L226 Difference]: Without dead ends: 68 [2018-01-28 23:35:52,060 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2018-01-28 23:35:52,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-28 23:35:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-01-28 23:35:52,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-28 23:35:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-28 23:35:52,068 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 29 [2018-01-28 23:35:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:52,068 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-28 23:35:52,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-28 23:35:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-28 23:35:52,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-28 23:35:52,069 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:52,069 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:52,070 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:52,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1214997696, now seen corresponding path program 1 times [2018-01-28 23:35:52,070 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:52,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:52,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:52,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:52,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:52,086 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:52,206 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-28 23:35:52,207 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:52,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 23:35:52,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 23:35:52,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 23:35:52,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-01-28 23:35:52,207 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 10 states. [2018-01-28 23:35:52,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:52,316 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2018-01-28 23:35:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 23:35:52,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-01-28 23:35:52,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:52,317 INFO L225 Difference]: With dead ends: 68 [2018-01-28 23:35:52,317 INFO L226 Difference]: Without dead ends: 67 [2018-01-28 23:35:52,317 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-01-28 23:35:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-28 23:35:52,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-28 23:35:52,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-28 23:35:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-01-28 23:35:52,322 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 29 [2018-01-28 23:35:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:52,323 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-01-28 23:35:52,323 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 23:35:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-01-28 23:35:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 23:35:52,324 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:52,325 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:52,325 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash 106276056, now seen corresponding path program 1 times [2018-01-28 23:35:52,325 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:52,325 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:52,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:52,326 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:52,326 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:52,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:52,384 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-28 23:35:52,385 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:52,385 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 23:35:52,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 23:35:52,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 23:35:52,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 23:35:52,385 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-01-28 23:35:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:52,429 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-28 23:35:52,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 23:35:52,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-28 23:35:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:52,430 INFO L225 Difference]: With dead ends: 67 [2018-01-28 23:35:52,430 INFO L226 Difference]: Without dead ends: 65 [2018-01-28 23:35:52,431 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 23:35:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-28 23:35:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-01-28 23:35:52,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-01-28 23:35:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-01-28 23:35:52,437 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 41 [2018-01-28 23:35:52,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:52,437 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-01-28 23:35:52,437 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 23:35:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-01-28 23:35:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 23:35:52,438 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:52,438 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:52,438 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:52,439 INFO L82 PathProgramCache]: Analyzing trace with hash 106276058, now seen corresponding path program 1 times [2018-01-28 23:35:52,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:52,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:52,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:52,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:52,440 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 23:35:52,458 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 23:35:52,803 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-28 23:35:52,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 23:35:52,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-28 23:35:52,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 23:35:52,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 23:35:52,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-01-28 23:35:52,804 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 16 states. [2018-01-28 23:35:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 23:35:53,208 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-01-28 23:35:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-28 23:35:53,208 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-01-28 23:35:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 23:35:53,209 INFO L225 Difference]: With dead ends: 84 [2018-01-28 23:35:53,209 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 23:35:53,209 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2018-01-28 23:35:53,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 23:35:53,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2018-01-28 23:35:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-28 23:35:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-28 23:35:53,216 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 41 [2018-01-28 23:35:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 23:35:53,217 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-28 23:35:53,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 23:35:53,217 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-28 23:35:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-28 23:35:53,218 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 23:35:53,219 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 23:35:53,219 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation]=== [2018-01-28 23:35:53,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1711877380, now seen corresponding path program 1 times [2018-01-28 23:35:53,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 23:35:53,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 23:35:53,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:53,220 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 23:35:53,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 23:35:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:35:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 23:35:53,289 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 23:35:53,293 INFO L84 mationBacktranslator]: Skipped ATE [357] [357] ULTIMATE.startENTRY-->L1: Formula: true InVars {} OutVars{#NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #valid=|v_#valid_9|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] [2018-01-28 23:35:53,293 INFO L84 mationBacktranslator]: Skipped ATE [363] [363] L1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,293 INFO L84 mationBacktranslator]: Skipped ATE [369] [369] mainENTRY-->L557: Formula: (and (<= 0 (+ |v_main_#t~nondet8_1| 2147483648)) (<= |v_main_#t~nondet8_1| 2147483647)) InVars {main_#t~nondet8=|v_main_#t~nondet8_1|} OutVars{main_#t~nondet8=|v_main_#t~nondet8_1|} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,294 INFO L84 mationBacktranslator]: Skipped ATE [373] [373] L557-->L557': Formula: (= v_main_~length~6_1 |v_main_#t~nondet8_2|) InVars {main_#t~nondet8=|v_main_#t~nondet8_2|} OutVars{main_#t~nondet8=|v_main_#t~nondet8_2|, main_~length~6=v_main_~length~6_1} AuxVars[] AssignedVars[main_~length~6] [2018-01-28 23:35:53,294 INFO L84 mationBacktranslator]: Skipped ATE [377] [377] L557'-->L558: Formula: true InVars {} OutVars{main_#t~nondet8=|v_main_#t~nondet8_3|} AuxVars[] AssignedVars[main_#t~nondet8] [2018-01-28 23:35:53,294 INFO L84 mationBacktranslator]: Skipped ATE [379] [379] L558-->L558': Formula: (and (<= |v_main_#t~nondet9_1| 2147483647) (<= 0 (+ |v_main_#t~nondet9_1| 2147483648))) InVars {main_#t~nondet9=|v_main_#t~nondet9_1|} OutVars{main_#t~nondet9=|v_main_#t~nondet9_1|} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,294 INFO L84 mationBacktranslator]: Skipped ATE [381] [381] L558'-->L558'': Formula: (= v_main_~n~6_1 |v_main_#t~nondet9_2|) InVars {main_#t~nondet9=|v_main_#t~nondet9_2|} OutVars{main_#t~nondet9=|v_main_#t~nondet9_2|, main_~n~6=v_main_~n~6_1} AuxVars[] AssignedVars[main_~n~6] [2018-01-28 23:35:53,294 INFO L84 mationBacktranslator]: Skipped ATE [383] [383] L558''-->L559: Formula: true InVars {} OutVars{main_#t~nondet9=|v_main_#t~nondet9_3|} AuxVars[] AssignedVars[main_#t~nondet9] [2018-01-28 23:35:53,295 INFO L84 mationBacktranslator]: Skipped ATE [387] [387] L559-->L559'': Formula: (not (< v_main_~length~6_4 1)) InVars {main_~length~6=v_main_~length~6_4} OutVars{main_~length~6=v_main_~length~6_4} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,295 INFO L84 mationBacktranslator]: Skipped ATE [393] [393] L559''-->L562': Formula: (not (< v_main_~n~6_4 1)) InVars {main_~n~6=v_main_~n~6_4} OutVars{main_~n~6=v_main_~n~6_4} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,295 INFO L84 mationBacktranslator]: Skipped ATE [397] [397] L562'-->L565: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_main_#t~malloc10.base_1| v_main_~n~6_5)) (= |v_#valid_13| (store |v_#valid_14| |v_main_#t~malloc10.base_1| 1)) (= 0 (select |v_#valid_14| |v_main_#t~malloc10.base_1|)) (not (= 0 |v_main_#t~malloc10.base_1|)) (= |v_main_#t~malloc10.offset_1| 0)) InVars {#length=|v_#length_10|, main_~n~6=v_main_~n~6_5, #valid=|v_#valid_14|} OutVars{#length=|v_#length_9|, main_#t~malloc10.offset=|v_main_#t~malloc10.offset_1|, main_~n~6=v_main_~n~6_5, main_#t~malloc10.base=|v_main_#t~malloc10.base_1|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc10.offset, main_#t~malloc10.base] [2018-01-28 23:35:53,295 INFO L84 mationBacktranslator]: Skipped ATE [399] [399] L565-->L566: Formula: (and (= v_main_~nondetArea~6.offset_1 |v_main_#t~malloc10.offset_2|) (= v_main_~nondetArea~6.base_1 |v_main_#t~malloc10.base_2|)) InVars {main_#t~malloc10.base=|v_main_#t~malloc10.base_2|, main_#t~malloc10.offset=|v_main_#t~malloc10.offset_2|} OutVars{main_~nondetArea~6.offset=v_main_~nondetArea~6.offset_1, main_#t~malloc10.offset=|v_main_#t~malloc10.offset_2|, main_~nondetArea~6.base=v_main_~nondetArea~6.base_1, main_#t~malloc10.base=|v_main_#t~malloc10.base_2|} AuxVars[] AssignedVars[main_~nondetArea~6.base, main_~nondetArea~6.offset] [2018-01-28 23:35:53,295 INFO L84 mationBacktranslator]: Skipped ATE [401] [401] L566-->L566': Formula: (and (= |v_#length_11| (store |v_#length_12| |v_main_#t~malloc11.base_1| v_main_~length~6_5)) (= |v_main_#t~malloc11.offset_1| 0) (not (= |v_main_#t~malloc11.base_1| 0)) (= (select |v_#valid_16| |v_main_#t~malloc11.base_1|) 0) (= (store |v_#valid_16| |v_main_#t~malloc11.base_1| 1) |v_#valid_15|)) InVars {#length=|v_#length_12|, #valid=|v_#valid_16|, main_~length~6=v_main_~length~6_5} OutVars{#length=|v_#length_11|, main_#t~malloc11.offset=|v_main_#t~malloc11.offset_1|, main_#t~malloc11.base=|v_main_#t~malloc11.base_1|, #valid=|v_#valid_15|, main_~length~6=v_main_~length~6_5} AuxVars[] AssignedVars[#valid, #length, main_#t~malloc11.offset, main_#t~malloc11.base] [2018-01-28 23:35:53,296 INFO L84 mationBacktranslator]: Skipped ATE [403] [403] L566'-->L567: Formula: (and (= v_main_~nondetString~6.base_1 |v_main_#t~malloc11.base_2|) (= v_main_~nondetString~6.offset_1 |v_main_#t~malloc11.offset_2|)) InVars {main_#t~malloc11.base=|v_main_#t~malloc11.base_2|, main_#t~malloc11.offset=|v_main_#t~malloc11.offset_2|} OutVars{main_#t~malloc11.offset=|v_main_#t~malloc11.offset_2|, main_#t~malloc11.base=|v_main_#t~malloc11.base_2|, main_~nondetString~6.base=v_main_~nondetString~6.base_1, main_~nondetString~6.offset=v_main_~nondetString~6.offset_1} AuxVars[] AssignedVars[main_~nondetString~6.offset, main_~nondetString~6.base] [2018-01-28 23:35:53,296 INFO L84 mationBacktranslator]: Skipped ATE [405] [405] L567-->L567': Formula: (let ((.cse0 (+ v_main_~length~6_6 v_main_~nondetString~6.offset_2))) (and (<= 1 .cse0) (= 1 (select |v_#valid_17| v_main_~nondetString~6.base_2)) (= |v_#memory_int_part_locs_0_locs_0_1| |v_#memory_int_part_locs_0_locs_0_2|) (<= .cse0 (select |v_#length_13| v_main_~nondetString~6.base_2)))) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_1|, main_~nondetString~6.offset=v_main_~nondetString~6.offset_2, main_~length~6=v_main_~length~6_6, #valid=|v_#valid_17|, #length=|v_#length_13|, main_~nondetString~6.base=v_main_~nondetString~6.base_2} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_2|, main_~nondetString~6.offset=v_main_~nondetString~6.offset_2, main_~length~6=v_main_~length~6_6, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, main_~nondetString~6.base=v_main_~nondetString~6.base_2} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:35:53,296 INFO L84 mationBacktranslator]: Skipped ATE [413] [413] L567'-->cstrncpyENTRY: Formula: (and (= |v_cstrncpy_#in~src.offsetInParam_1| v_main_~nondetString~6.offset_5) (= |v_cstrncpy_#in~dst.baseInParam_1| v_main_~nondetArea~6.base_3) (= |v_cstrncpy_#in~nInParam_1| v_main_~n~6_7) (= |v_cstrncpy_#in~src.baseInParam_1| v_main_~nondetString~6.base_6) (= |v_cstrncpy_#in~dst.offsetInParam_1| v_main_~nondetArea~6.offset_3)) InVars {main_~nondetArea~6.offset=v_main_~nondetArea~6.offset_3, main_~nondetArea~6.base=v_main_~nondetArea~6.base_3, main_~n~6=v_main_~n~6_7, main_~nondetString~6.base=v_main_~nondetString~6.base_6, main_~nondetString~6.offset=v_main_~nondetString~6.offset_5} OutVars{cstrncpy_#in~n=|v_cstrncpy_#in~nInParam_1|, cstrncpy_#in~src.offset=|v_cstrncpy_#in~src.offsetInParam_1|, cstrncpy_#in~src.base=|v_cstrncpy_#in~src.baseInParam_1|, cstrncpy_#in~dst.offset=|v_cstrncpy_#in~dst.offsetInParam_1|, cstrncpy_#in~dst.base=|v_cstrncpy_#in~dst.baseInParam_1|} AuxVars[] AssignedVars[cstrncpy_#in~n, cstrncpy_#in~src.base, cstrncpy_#in~dst.offset, cstrncpy_#in~dst.base, cstrncpy_#in~src.offset] [2018-01-28 23:35:53,296 INFO L84 mationBacktranslator]: Skipped ATE [417] [417] cstrncpyENTRY-->L540: Formula: (and (= v_cstrncpy_~dst.offset_1 |v_cstrncpy_#in~dst.offset_1|) (= v_cstrncpy_~dst.base_1 |v_cstrncpy_#in~dst.base_1|)) InVars {cstrncpy_#in~dst.offset=|v_cstrncpy_#in~dst.offset_1|, cstrncpy_#in~dst.base=|v_cstrncpy_#in~dst.base_1|} OutVars{cstrncpy_~dst.base=v_cstrncpy_~dst.base_1, cstrncpy_#in~dst.offset=|v_cstrncpy_#in~dst.offset_1|, cstrncpy_#in~dst.base=|v_cstrncpy_#in~dst.base_1|, cstrncpy_~dst.offset=v_cstrncpy_~dst.offset_1} AuxVars[] AssignedVars[cstrncpy_~dst.base, cstrncpy_~dst.offset] [2018-01-28 23:35:53,296 INFO L84 mationBacktranslator]: Skipped ATE [421] [421] L540-->L540': Formula: (and (= v_cstrncpy_~src.base_1 |v_cstrncpy_#in~src.base_1|) (= v_cstrncpy_~src.offset_1 |v_cstrncpy_#in~src.offset_1|)) InVars {cstrncpy_#in~src.offset=|v_cstrncpy_#in~src.offset_1|, cstrncpy_#in~src.base=|v_cstrncpy_#in~src.base_1|} OutVars{cstrncpy_~src.base=v_cstrncpy_~src.base_1, cstrncpy_#in~src.offset=|v_cstrncpy_#in~src.offset_1|, cstrncpy_~src.offset=v_cstrncpy_~src.offset_1, cstrncpy_#in~src.base=|v_cstrncpy_#in~src.base_1|} AuxVars[] AssignedVars[cstrncpy_~src.base, cstrncpy_~src.offset] [2018-01-28 23:35:53,296 INFO L84 mationBacktranslator]: Skipped ATE [425] [425] L540'-->L543: Formula: (= v_cstrncpy_~n_1 |v_cstrncpy_#in~n_1|) InVars {cstrncpy_#in~n=|v_cstrncpy_#in~n_1|} OutVars{cstrncpy_#in~n=|v_cstrncpy_#in~n_1|, cstrncpy_~n=v_cstrncpy_~n_1} AuxVars[] AssignedVars[cstrncpy_~n] [2018-01-28 23:35:53,297 INFO L84 mationBacktranslator]: Skipped ATE [429] [429] L543-->L544: Formula: (not (= 0 (mod v_cstrncpy_~n_2 4294967296))) InVars {cstrncpy_~n=v_cstrncpy_~n_2} OutVars{cstrncpy_~n=v_cstrncpy_~n_2} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,297 INFO L84 mationBacktranslator]: Skipped ATE [435] [435] L544-->L545: Formula: (and (= v_cstrncpy_~d~3.offset_1 v_cstrncpy_~dst.offset_2) (= v_cstrncpy_~d~3.base_1 v_cstrncpy_~dst.base_2)) InVars {cstrncpy_~dst.base=v_cstrncpy_~dst.base_2, cstrncpy_~dst.offset=v_cstrncpy_~dst.offset_2} OutVars{cstrncpy_~d~3.offset=v_cstrncpy_~d~3.offset_1, cstrncpy_~dst.base=v_cstrncpy_~dst.base_2, cstrncpy_~d~3.base=v_cstrncpy_~d~3.base_1, cstrncpy_~dst.offset=v_cstrncpy_~dst.offset_2} AuxVars[] AssignedVars[cstrncpy_~d~3.offset, cstrncpy_~d~3.base] [2018-01-28 23:35:53,297 INFO L84 mationBacktranslator]: Skipped ATE [441] [441] L545-->L546''': Formula: (and (= v_cstrncpy_~s~3.base_1 v_cstrncpy_~src.base_2) (= v_cstrncpy_~s~3.offset_1 v_cstrncpy_~src.offset_2)) InVars {cstrncpy_~src.base=v_cstrncpy_~src.base_2, cstrncpy_~src.offset=v_cstrncpy_~src.offset_2} OutVars{cstrncpy_~src.base=v_cstrncpy_~src.base_2, cstrncpy_~src.offset=v_cstrncpy_~src.offset_2, cstrncpy_~s~3.offset=v_cstrncpy_~s~3.offset_1, cstrncpy_~s~3.base=v_cstrncpy_~s~3.base_1} AuxVars[] AssignedVars[cstrncpy_~s~3.base, cstrncpy_~s~3.offset] [2018-01-28 23:35:53,297 INFO L84 mationBacktranslator]: Skipped ATE [449] [449] L546'''-->L547: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,297 INFO L84 mationBacktranslator]: Skipped ATE [453] [453] L547-->L547': Formula: (and (= |v_cstrncpy_#t~post1.offset_1| v_cstrncpy_~d~3.offset_2) (= |v_cstrncpy_#t~post1.base_1| v_cstrncpy_~d~3.base_2)) InVars {cstrncpy_~d~3.offset=v_cstrncpy_~d~3.offset_2, cstrncpy_~d~3.base=v_cstrncpy_~d~3.base_2} OutVars{cstrncpy_~d~3.offset=v_cstrncpy_~d~3.offset_2, cstrncpy_#t~post1.offset=|v_cstrncpy_#t~post1.offset_1|, cstrncpy_~d~3.base=v_cstrncpy_~d~3.base_2, cstrncpy_#t~post1.base=|v_cstrncpy_#t~post1.base_1|} AuxVars[] AssignedVars[cstrncpy_#t~post1.offset, cstrncpy_#t~post1.base] [2018-01-28 23:35:53,297 INFO L84 mationBacktranslator]: Skipped ATE [455] [455] L547'-->L547'': Formula: (and (= v_cstrncpy_~d~3.base_3 |v_cstrncpy_#t~post1.base_2|) (= v_cstrncpy_~d~3.offset_3 (+ |v_cstrncpy_#t~post1.offset_2| 1))) InVars {cstrncpy_#t~post1.offset=|v_cstrncpy_#t~post1.offset_2|, cstrncpy_#t~post1.base=|v_cstrncpy_#t~post1.base_2|} OutVars{cstrncpy_~d~3.offset=v_cstrncpy_~d~3.offset_3, cstrncpy_#t~post1.offset=|v_cstrncpy_#t~post1.offset_2|, cstrncpy_~d~3.base=v_cstrncpy_~d~3.base_3, cstrncpy_#t~post1.base=|v_cstrncpy_#t~post1.base_2|} AuxVars[] AssignedVars[cstrncpy_~d~3.offset, cstrncpy_~d~3.base] [2018-01-28 23:35:53,298 INFO L84 mationBacktranslator]: Skipped ATE [457] [457] L547''-->L547''': Formula: (and (= |v_cstrncpy_#t~post2.base_1| v_cstrncpy_~s~3.base_2) (= |v_cstrncpy_#t~post2.offset_1| v_cstrncpy_~s~3.offset_2)) InVars {cstrncpy_~s~3.base=v_cstrncpy_~s~3.base_2, cstrncpy_~s~3.offset=v_cstrncpy_~s~3.offset_2} OutVars{cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_1|, cstrncpy_~s~3.offset=v_cstrncpy_~s~3.offset_2, cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_1|, cstrncpy_~s~3.base=v_cstrncpy_~s~3.base_2} AuxVars[] AssignedVars[cstrncpy_#t~post2.offset, cstrncpy_#t~post2.base] [2018-01-28 23:35:53,298 INFO L84 mationBacktranslator]: Skipped ATE [459] [459] L547'''-->L547'''': Formula: (and (= v_cstrncpy_~s~3.base_3 |v_cstrncpy_#t~post2.base_2|) (= v_cstrncpy_~s~3.offset_3 (+ |v_cstrncpy_#t~post2.offset_2| 1))) InVars {cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_2|, cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_2|} OutVars{cstrncpy_~s~3.offset=v_cstrncpy_~s~3.offset_3, cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_2|, cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_2|, cstrncpy_~s~3.base=v_cstrncpy_~s~3.base_3} AuxVars[] AssignedVars[cstrncpy_~s~3.base, cstrncpy_~s~3.offset] [2018-01-28 23:35:53,298 INFO L84 mationBacktranslator]: Skipped ATE [461] [461] L547''''-->L547''''': Formula: (and (= (select |v_#valid_1| |v_cstrncpy_#t~post2.base_3|) 1) (<= (+ |v_cstrncpy_#t~post2.offset_3| 1) (select |v_#length_1| |v_cstrncpy_#t~post2.base_3|)) (= (select (select |v_#memory_int_part_locs_0_locs_0_3| |v_cstrncpy_#t~post2.base_3|) |v_cstrncpy_#t~post2.offset_3|) |v_cstrncpy_#t~mem4_1|) (<= 0 |v_cstrncpy_#t~post2.offset_3|)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, #length=|v_#length_1|, cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_3|, cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_3|, #valid=|v_#valid_1|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_3|, cstrncpy_#t~mem4=|v_cstrncpy_#t~mem4_1|, #valid=|v_#valid_1|, #length=|v_#length_1|, cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_3|, cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_3|} AuxVars[] AssignedVars[cstrncpy_#t~mem4] [2018-01-28 23:35:53,298 INFO L84 mationBacktranslator]: Skipped ATE [467] [467] L547'''''-->L547'''''': Formula: (and (<= (+ |v_cstrncpy_#t~post1.offset_3| 1) (select |v_#length_3| |v_cstrncpy_#t~post1.base_3|)) (<= 0 |v_cstrncpy_#t~post1.offset_3|) (= 1 (select |v_#valid_3| |v_cstrncpy_#t~post1.base_3|)) (= |v_#memory_int_part_locs_0_locs_0_4| |v_#memory_int_part_locs_0_locs_0_5|)) InVars {#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_5|, #length=|v_#length_3|, cstrncpy_#t~post1.offset=|v_cstrncpy_#t~post1.offset_3|, cstrncpy_#t~post1.base=|v_cstrncpy_#t~post1.base_3|, #valid=|v_#valid_3|} OutVars{#memory_int_part_locs_0_locs_0=|v_#memory_int_part_locs_0_locs_0_4|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|, cstrncpy_#t~post1.offset=|v_cstrncpy_#t~post1.offset_3|, cstrncpy_#t~post1.base=|v_cstrncpy_#t~post1.base_3|} AuxVars[] AssignedVars[#memory_int_part_locs_0_locs_0, #memory_int] [2018-01-28 23:35:53,298 INFO L84 mationBacktranslator]: Skipped ATE [475] [475] L547''''''-->L547'''''''''': Formula: (not (= 0 |v_cstrncpy_#t~mem4_5|)) InVars {cstrncpy_#t~mem4=|v_cstrncpy_#t~mem4_5|} OutVars{cstrncpy_#t~mem4=|v_cstrncpy_#t~mem4_5|} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,298 INFO L84 mationBacktranslator]: Skipped ATE [479] [479] L547''''''''''-->L547''''''''''': Formula: true InVars {} OutVars{cstrncpy_#t~post1.offset=|v_cstrncpy_#t~post1.offset_6|, cstrncpy_#t~post1.base=|v_cstrncpy_#t~post1.base_7|} AuxVars[] AssignedVars[cstrncpy_#t~post1.offset, cstrncpy_#t~post1.base] [2018-01-28 23:35:53,299 INFO L84 mationBacktranslator]: Skipped ATE [483] [483] L547'''''''''''-->L547'''''''''''': Formula: true InVars {} OutVars{cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_7|, cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_6|} AuxVars[] AssignedVars[cstrncpy_#t~post2.offset, cstrncpy_#t~post2.base] [2018-01-28 23:35:53,299 INFO L84 mationBacktranslator]: Skipped ATE [487] [487] L547''''''''''''-->L546: Formula: true InVars {} OutVars{cstrncpy_#t~mem4=|v_cstrncpy_#t~mem4_6|} AuxVars[] AssignedVars[cstrncpy_#t~mem4] [2018-01-28 23:35:53,299 INFO L84 mationBacktranslator]: Skipped ATE [493] [493] L546-->L552: Formula: (= |v_cstrncpy_#t~pre0_1| (+ v_cstrncpy_~n_6 (- 1))) InVars {cstrncpy_~n=v_cstrncpy_~n_6} OutVars{cstrncpy_#t~pre0=|v_cstrncpy_#t~pre0_1|, cstrncpy_~n=v_cstrncpy_~n_6} AuxVars[] AssignedVars[cstrncpy_#t~pre0] [2018-01-28 23:35:53,299 INFO L84 mationBacktranslator]: Skipped ATE [497] [497] L552-->L546': Formula: (= v_cstrncpy_~n_7 (+ v_cstrncpy_~n_8 (- 1))) InVars {cstrncpy_~n=v_cstrncpy_~n_8} OutVars{cstrncpy_~n=v_cstrncpy_~n_7} AuxVars[] AssignedVars[cstrncpy_~n] [2018-01-28 23:35:53,299 INFO L84 mationBacktranslator]: Skipped ATE [503] [503] L546'-->L552'': Formula: (not (= 0 (mod |v_cstrncpy_#t~pre0_4| 4294967296))) InVars {cstrncpy_#t~pre0=|v_cstrncpy_#t~pre0_4|} OutVars{cstrncpy_#t~pre0=|v_cstrncpy_#t~pre0_4|} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,299 INFO L84 mationBacktranslator]: Skipped ATE [511] [511] L552''-->L546''': Formula: true InVars {} OutVars{cstrncpy_#t~pre0=|v_cstrncpy_#t~pre0_5|} AuxVars[] AssignedVars[cstrncpy_#t~pre0] [2018-01-28 23:35:53,300 INFO L84 mationBacktranslator]: Skipped ATE [449] [449] L546'''-->L547: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,300 INFO L84 mationBacktranslator]: Skipped ATE [453] [453] L547-->L547': Formula: (and (= |v_cstrncpy_#t~post1.offset_1| v_cstrncpy_~d~3.offset_2) (= |v_cstrncpy_#t~post1.base_1| v_cstrncpy_~d~3.base_2)) InVars {cstrncpy_~d~3.offset=v_cstrncpy_~d~3.offset_2, cstrncpy_~d~3.base=v_cstrncpy_~d~3.base_2} OutVars{cstrncpy_~d~3.offset=v_cstrncpy_~d~3.offset_2, cstrncpy_#t~post1.offset=|v_cstrncpy_#t~post1.offset_1|, cstrncpy_~d~3.base=v_cstrncpy_~d~3.base_2, cstrncpy_#t~post1.base=|v_cstrncpy_#t~post1.base_1|} AuxVars[] AssignedVars[cstrncpy_#t~post1.offset, cstrncpy_#t~post1.base] [2018-01-28 23:35:53,300 INFO L84 mationBacktranslator]: Skipped ATE [455] [455] L547'-->L547'': Formula: (and (= v_cstrncpy_~d~3.base_3 |v_cstrncpy_#t~post1.base_2|) (= v_cstrncpy_~d~3.offset_3 (+ |v_cstrncpy_#t~post1.offset_2| 1))) InVars {cstrncpy_#t~post1.offset=|v_cstrncpy_#t~post1.offset_2|, cstrncpy_#t~post1.base=|v_cstrncpy_#t~post1.base_2|} OutVars{cstrncpy_~d~3.offset=v_cstrncpy_~d~3.offset_3, cstrncpy_#t~post1.offset=|v_cstrncpy_#t~post1.offset_2|, cstrncpy_~d~3.base=v_cstrncpy_~d~3.base_3, cstrncpy_#t~post1.base=|v_cstrncpy_#t~post1.base_2|} AuxVars[] AssignedVars[cstrncpy_~d~3.offset, cstrncpy_~d~3.base] [2018-01-28 23:35:53,300 INFO L84 mationBacktranslator]: Skipped ATE [457] [457] L547''-->L547''': Formula: (and (= |v_cstrncpy_#t~post2.base_1| v_cstrncpy_~s~3.base_2) (= |v_cstrncpy_#t~post2.offset_1| v_cstrncpy_~s~3.offset_2)) InVars {cstrncpy_~s~3.base=v_cstrncpy_~s~3.base_2, cstrncpy_~s~3.offset=v_cstrncpy_~s~3.offset_2} OutVars{cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_1|, cstrncpy_~s~3.offset=v_cstrncpy_~s~3.offset_2, cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_1|, cstrncpy_~s~3.base=v_cstrncpy_~s~3.base_2} AuxVars[] AssignedVars[cstrncpy_#t~post2.offset, cstrncpy_#t~post2.base] [2018-01-28 23:35:53,300 INFO L84 mationBacktranslator]: Skipped ATE [459] [459] L547'''-->L547'''': Formula: (and (= v_cstrncpy_~s~3.base_3 |v_cstrncpy_#t~post2.base_2|) (= v_cstrncpy_~s~3.offset_3 (+ |v_cstrncpy_#t~post2.offset_2| 1))) InVars {cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_2|, cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_2|} OutVars{cstrncpy_~s~3.offset=v_cstrncpy_~s~3.offset_3, cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_2|, cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_2|, cstrncpy_~s~3.base=v_cstrncpy_~s~3.base_3} AuxVars[] AssignedVars[cstrncpy_~s~3.base, cstrncpy_~s~3.offset] [2018-01-28 23:35:53,300 INFO L84 mationBacktranslator]: Skipped ATE [465] [465] L547''''-->cstrncpyErr1RequiresViolation: Formula: (or (not (<= 0 |v_cstrncpy_#t~post2.offset_4|)) (not (<= (+ |v_cstrncpy_#t~post2.offset_4| 1) (select |v_#length_2| |v_cstrncpy_#t~post2.base_5|)))) InVars {#length=|v_#length_2|, cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_4|, cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_5|} OutVars{#length=|v_#length_2|, cstrncpy_#t~post2.offset=|v_cstrncpy_#t~post2.offset_4|, cstrncpy_#t~post2.base=|v_cstrncpy_#t~post2.base_5|} AuxVars[] AssignedVars[] [2018-01-28 23:35:53,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 11:35:53 BasicIcfg [2018-01-28 23:35:53,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 23:35:53,308 INFO L168 Benchmark]: Toolchain (without parser) took 44588.17 ms. Allocated memory was 299.9 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 259.8 MB in the beginning and 1.7 GB in the end (delta: -1.4 GB). Peak memory consumption was 503.7 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:53,309 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 299.9 MB. Free memory is still 265.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 23:35:53,309 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.39 ms. Allocated memory is still 299.9 MB. Free memory was 258.8 MB in the beginning and 248.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:53,309 INFO L168 Benchmark]: Boogie Preprocessor took 40.81 ms. Allocated memory is still 299.9 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:53,310 INFO L168 Benchmark]: RCFGBuilder took 315.69 ms. Allocated memory is still 299.9 MB. Free memory was 246.8 MB in the beginning and 225.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:53,310 INFO L168 Benchmark]: IcfgTransformer took 40651.73 ms. Allocated memory was 299.9 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 225.8 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 560.0 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:53,310 INFO L168 Benchmark]: TraceAbstraction took 3376.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 464.7 MB). Peak memory consumption was 464.7 MB. Max. memory is 5.3 GB. [2018-01-28 23:35:53,312 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.15 ms. Allocated memory is still 299.9 MB. Free memory is still 265.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 194.39 ms. Allocated memory is still 299.9 MB. Free memory was 258.8 MB in the beginning and 248.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.81 ms. Allocated memory is still 299.9 MB. Free memory was 248.8 MB in the beginning and 246.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 315.69 ms. Allocated memory is still 299.9 MB. Free memory was 246.8 MB in the beginning and 225.8 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 5.3 GB. * IcfgTransformer took 40651.73 ms. Allocated memory was 299.9 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 225.8 MB in the beginning and 2.2 GB in the end (delta: -1.9 GB). Peak memory consumption was 560.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3376.90 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 464.7 MB). Peak memory consumption was 464.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 74 LocStat_MAX_WEQGRAPH_SIZE : 4 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 1179 LocStat_NO_SUPPORTING_DISEQUALITIES : 508 LocStat_NO_DISJUNCTIONS : -148 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 98 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 121 TransStat_NO_SUPPORTING_DISEQUALITIES : 13 TransStat_NO_DISJUNCTIONS : 100 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 6.775274 RENAME_VARIABLES(MILLISECONDS) : 0.561722 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 3.353591 PROJECTAWAY(MILLISECONDS) : 0.060723 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.030415 DISJOIN(MILLISECONDS) : 0.142938 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.579560 ADD_EQUALITY(MILLISECONDS) : 0.011892 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015140 #CONJOIN_DISJUNCTIVE : 1074 #RENAME_VARIABLES : 2314 #UNFREEZE : 0 #CONJOIN : 1414 #PROJECTAWAY : 1346 #ADD_WEAK_EQUALITY : 13 #DISJOIN : 295 #RENAME_VARIABLES_DISJUNCTIVE : 2287 #ADD_EQUALITY : 124 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 11 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: HeapSeparatorStatistics COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_0 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_0 : 1 COUNT_ARRAY_WRITES_for_[#memory_int]_at_dim_1 : 1 COUNT_BLOCKS_for_[#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int] : 4 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 9 error locations. UNSAFE Result, 3.3s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 523 SDtfs, 764 SDslu, 1737 SDs, 0 SdLazy, 967 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 44932 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-Benchmark-0-2018-01-28_23-35-53-322.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-VPDomainBenchmark-0-2018-01-28_23-35-53-322.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-BenchmarkWithCounters-0-2018-01-28_23-35-53-322.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-HeapSeparatorBenchmark-0-2018-01-28_23-35-53-322.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerCTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_23-35-53-322.csv Received shutdown request...