java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 20:57:26,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 20:57:26,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 20:57:26,812 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 20:57:26,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 20:57:26,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 20:57:26,815 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 20:57:26,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 20:57:26,819 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 20:57:26,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 20:57:26,820 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 20:57:26,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 20:57:26,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 20:57:26,822 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 20:57:26,823 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 20:57:26,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 20:57:26,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 20:57:26,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 20:57:26,832 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 20:57:26,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 20:57:26,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 20:57:26,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 20:57:26,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 20:57:26,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 20:57:26,838 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 20:57:26,839 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 20:57:26,839 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 20:57:26,840 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 20:57:26,840 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 20:57:26,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 20:57:26,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 20:57:26,841 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 20:57:26,851 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 20:57:26,852 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 20:57:26,852 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 20:57:26,853 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 20:57:26,853 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 20:57:26,853 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 20:57:26,853 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 20:57:26,854 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 20:57:26,854 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 20:57:26,854 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 20:57:26,855 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 20:57:26,855 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 20:57:26,855 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 20:57:26,855 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 20:57:26,855 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 20:57:26,855 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 20:57:26,856 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 20:57:26,856 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 20:57:26,856 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 20:57:26,856 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 20:57:26,856 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 20:57:26,857 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 20:57:26,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 20:57:26,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 20:57:26,857 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 20:57:26,858 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 20:57:26,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 20:57:26,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 20:57:26,858 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 20:57:26,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 20:57:26,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 20:57:26,859 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 20:57:26,860 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 20:57:26,860 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 20:57:26,895 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 20:57:26,906 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 20:57:26,910 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 20:57:26,911 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 20:57:26,912 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 20:57:26,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrchr_unsafe_false-valid-deref.i [2018-01-28 20:57:27,081 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 20:57:27,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 20:57:27,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 20:57:27,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 20:57:27,092 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 20:57:27,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:57:27" (1/1) ... [2018-01-28 20:57:27,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d356b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27, skipping insertion in model container [2018-01-28 20:57:27,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 08:57:27" (1/1) ... [2018-01-28 20:57:27,114 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 20:57:27,155 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 20:57:27,274 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 20:57:27,289 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 20:57:27,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27 WrapperNode [2018-01-28 20:57:27,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 20:57:27,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 20:57:27,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 20:57:27,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 20:57:27,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27" (1/1) ... [2018-01-28 20:57:27,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27" (1/1) ... [2018-01-28 20:57:27,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27" (1/1) ... [2018-01-28 20:57:27,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27" (1/1) ... [2018-01-28 20:57:27,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27" (1/1) ... [2018-01-28 20:57:27,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27" (1/1) ... [2018-01-28 20:57:27,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27" (1/1) ... [2018-01-28 20:57:27,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 20:57:27,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 20:57:27,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 20:57:27,343 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 20:57:27,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27" (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 20:57:27,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 20:57:27,410 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 20:57:27,410 INFO L136 BoogieDeclarations]: Found implementation of procedure build_nondet_String [2018-01-28 20:57:27,410 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrchr [2018-01-28 20:57:27,411 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 20:57:27,411 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 20:57:27,411 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 20:57:27,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 20:57:27,411 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 20:57:27,411 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 20:57:27,411 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 20:57:27,412 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 20:57:27,412 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 20:57:27,412 INFO L128 BoogieDeclarations]: Found specification of procedure build_nondet_String [2018-01-28 20:57:27,412 INFO L128 BoogieDeclarations]: Found specification of procedure cstrchr [2018-01-28 20:57:27,412 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 20:57:27,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 20:57:27,412 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 20:57:27,646 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 20:57:27,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:57:27 BoogieIcfgContainer [2018-01-28 20:57:27,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 20:57:27,648 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 20:57:27,648 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 20:57:27,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 20:57:27,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 08:57:27" (1/3) ... [2018-01-28 20:57:27,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4934f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:57:27, skipping insertion in model container [2018-01-28 20:57:27,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 08:57:27" (2/3) ... [2018-01-28 20:57:27,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4934f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 08:57:27, skipping insertion in model container [2018-01-28 20:57:27,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 08:57:27" (3/3) ... [2018-01-28 20:57:27,655 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrchr_unsafe_false-valid-deref.i [2018-01-28 20:57:27,665 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 20:57:27,672 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-28 20:57:27,712 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 20:57:27,712 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 20:57:27,713 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 20:57:27,713 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 20:57:27,713 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 20:57:27,713 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 20:57:27,713 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 20:57:27,713 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 20:57:27,714 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 20:57:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-01-28 20:57:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-28 20:57:27,737 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:27,738 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:57:27,738 INFO L371 AbstractCegarLoop]: === Iteration 1 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1553699360, now seen corresponding path program 1 times [2018-01-28 20:57:27,743 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:27,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:27,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:27,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:27,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:27,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:57:27,927 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 20:57:27,931 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:57:27,931 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 20:57:27,934 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 20:57:27,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 20:57:27,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 20:57:27,949 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 4 states. [2018-01-28 20:57:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:57:28,112 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2018-01-28 20:57:28,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 20:57:28,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-28 20:57:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:57:28,124 INFO L225 Difference]: With dead ends: 100 [2018-01-28 20:57:28,125 INFO L226 Difference]: Without dead ends: 69 [2018-01-28 20:57:28,128 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 20:57:28,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-28 20:57:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-01-28 20:57:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-01-28 20:57:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2018-01-28 20:57:28,164 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 14 [2018-01-28 20:57:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:57:28,164 INFO L432 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2018-01-28 20:57:28,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 20:57:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2018-01-28 20:57:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-28 20:57:28,165 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:28,165 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:57:28,165 INFO L371 AbstractCegarLoop]: === Iteration 2 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:28,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1553699361, now seen corresponding path program 1 times [2018-01-28 20:57:28,166 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:28,166 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:28,167 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:28,167 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:28,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:28,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:57:28,326 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 20:57:28,326 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:57:28,327 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 20:57:28,329 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 20:57:28,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 20:57:28,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 20:57:28,330 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 5 states. [2018-01-28 20:57:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:57:28,410 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-01-28 20:57:28,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 20:57:28,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-28 20:57:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:57:28,412 INFO L225 Difference]: With dead ends: 69 [2018-01-28 20:57:28,412 INFO L226 Difference]: Without dead ends: 68 [2018-01-28 20:57:28,413 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 20:57:28,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-28 20:57:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-01-28 20:57:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-28 20:57:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2018-01-28 20:57:28,421 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 14 [2018-01-28 20:57:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:57:28,422 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2018-01-28 20:57:28,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 20:57:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-01-28 20:57:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 20:57:28,423 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:28,423 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] [2018-01-28 20:57:28,423 INFO L371 AbstractCegarLoop]: === Iteration 3 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1194220645, now seen corresponding path program 1 times [2018-01-28 20:57:28,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:28,424 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:28,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:28,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:28,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:28,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:57:28,546 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 20:57:28,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:57:28,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 20:57:28,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 20:57:28,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 20:57:28,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 20:57:28,548 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 8 states. [2018-01-28 20:57:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:57:28,706 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-01-28 20:57:28,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 20:57:28,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-28 20:57:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:57:28,707 INFO L225 Difference]: With dead ends: 72 [2018-01-28 20:57:28,707 INFO L226 Difference]: Without dead ends: 68 [2018-01-28 20:57:28,708 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-28 20:57:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-28 20:57:28,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-01-28 20:57:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-28 20:57:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-01-28 20:57:28,714 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 25 [2018-01-28 20:57:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:57:28,714 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-01-28 20:57:28,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 20:57:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-01-28 20:57:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-28 20:57:28,715 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:28,715 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] [2018-01-28 20:57:28,715 INFO L371 AbstractCegarLoop]: === Iteration 4 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1194220644, now seen corresponding path program 1 times [2018-01-28 20:57:28,715 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:28,715 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:28,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:28,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:28,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:28,730 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:57:28,915 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 20:57:28,916 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:57:28,916 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 20:57:28,916 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 20:57:28,917 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 20:57:28,917 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 20:57:28,917 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 11 states. [2018-01-28 20:57:29,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:57:29,145 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-28 20:57:29,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 20:57:29,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-01-28 20:57:29,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:57:29,149 INFO L225 Difference]: With dead ends: 92 [2018-01-28 20:57:29,149 INFO L226 Difference]: Without dead ends: 88 [2018-01-28 20:57:29,150 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2018-01-28 20:57:29,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-28 20:57:29,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2018-01-28 20:57:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-28 20:57:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-01-28 20:57:29,155 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 25 [2018-01-28 20:57:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:57:29,156 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-01-28 20:57:29,156 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 20:57:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-01-28 20:57:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-28 20:57:29,157 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:29,157 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:57:29,157 INFO L371 AbstractCegarLoop]: === Iteration 5 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:29,157 INFO L82 PathProgramCache]: Analyzing trace with hash -610285232, now seen corresponding path program 1 times [2018-01-28 20:57:29,157 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:29,157 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:29,158 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:29,158 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:29,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:57:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:57:29,216 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:57:29,216 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 20:57:29,217 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 20:57:29,217 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 20:57:29,217 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 20:57:29,218 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 3 states. [2018-01-28 20:57:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:57:29,247 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2018-01-28 20:57:29,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 20:57:29,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-01-28 20:57:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:57:29,251 INFO L225 Difference]: With dead ends: 117 [2018-01-28 20:57:29,251 INFO L226 Difference]: Without dead ends: 77 [2018-01-28 20:57:29,252 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 20:57:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-28 20:57:29,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-01-28 20:57:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-01-28 20:57:29,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-01-28 20:57:29,260 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 36 [2018-01-28 20:57:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:57:29,261 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-01-28 20:57:29,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 20:57:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-01-28 20:57:29,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 20:57:29,262 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:29,263 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:57:29,263 INFO L371 AbstractCegarLoop]: === Iteration 6 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:29,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1193627987, now seen corresponding path program 1 times [2018-01-28 20:57:29,263 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:29,263 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:29,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:29,265 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:29,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:29,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:57:29,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:57:29,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:57:29,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 20:57:29,341 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 20:57:29,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 20:57:29,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 20:57:29,342 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 4 states. [2018-01-28 20:57:29,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:57:29,387 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-01-28 20:57:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 20:57:29,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-01-28 20:57:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:57:29,390 INFO L225 Difference]: With dead ends: 77 [2018-01-28 20:57:29,390 INFO L226 Difference]: Without dead ends: 76 [2018-01-28 20:57:29,390 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:57:29,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-28 20:57:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-28 20:57:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-28 20:57:29,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-01-28 20:57:29,396 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 38 [2018-01-28 20:57:29,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:57:29,396 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-01-28 20:57:29,397 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 20:57:29,397 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-01-28 20:57:29,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 20:57:29,397 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:29,398 INFO L330 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 20:57:29,398 INFO L371 AbstractCegarLoop]: === Iteration 7 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:29,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1193627988, now seen corresponding path program 1 times [2018-01-28 20:57:29,398 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:29,398 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:29,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:29,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:29,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:29,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:57:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:57:29,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 20:57:29,975 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 20:57:29,987 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:30,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 20:57:30,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-01-28 20:57:30,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-01-28 20:57:30,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 20:57:30,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 20:57:30,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-28 20:57:30,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 20:57:30,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-01-28 20:57:30,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2018-01-28 20:57:30,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 20:57:30,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:57:30,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 20:57:30,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:33 [2018-01-28 20:57:30,861 WARN L146 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 18 DAG size of output 17 [2018-01-28 20:57:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 20:57:30,980 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 20:57:30,980 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 25 [2018-01-28 20:57:30,981 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-28 20:57:30,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-28 20:57:30,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-01-28 20:57:30,981 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 26 states. [2018-01-28 20:57:32,115 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 59 DAG size of output 44 [2018-01-28 20:57:33,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:57:33,282 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2018-01-28 20:57:33,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 20:57:33,282 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-01-28 20:57:33,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:57:33,284 INFO L225 Difference]: With dead ends: 130 [2018-01-28 20:57:33,284 INFO L226 Difference]: Without dead ends: 127 [2018-01-28 20:57:33,285 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=206, Invalid=1516, Unknown=0, NotChecked=0, Total=1722 [2018-01-28 20:57:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-28 20:57:33,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 89. [2018-01-28 20:57:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-28 20:57:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-01-28 20:57:33,295 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 38 [2018-01-28 20:57:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:57:33,295 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-01-28 20:57:33,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-28 20:57:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-01-28 20:57:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 20:57:33,296 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:33,297 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] [2018-01-28 20:57:33,297 INFO L371 AbstractCegarLoop]: === Iteration 8 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:33,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1928744096, now seen corresponding path program 1 times [2018-01-28 20:57:33,297 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:33,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:33,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:33,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:33,298 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:33,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:57:33,426 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 20:57:33,426 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:57:33,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 20:57:33,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 20:57:33,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 20:57:33,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 20:57:33,428 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 6 states. [2018-01-28 20:57:33,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:57:33,631 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-28 20:57:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 20:57:33,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-01-28 20:57:33,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:57:33,632 INFO L225 Difference]: With dead ends: 97 [2018-01-28 20:57:33,633 INFO L226 Difference]: Without dead ends: 96 [2018-01-28 20:57:33,633 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-28 20:57:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-28 20:57:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-01-28 20:57:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-28 20:57:33,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2018-01-28 20:57:33,642 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 40 [2018-01-28 20:57:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:57:33,643 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2018-01-28 20:57:33,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 20:57:33,643 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2018-01-28 20:57:33,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 20:57:33,644 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:33,644 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] [2018-01-28 20:57:33,645 INFO L371 AbstractCegarLoop]: === Iteration 9 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:33,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1928744097, now seen corresponding path program 1 times [2018-01-28 20:57:33,645 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:33,645 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:33,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:33,646 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:33,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 20:57:33,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 20:57:34,041 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 20:57:34,041 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 20:57:34,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-28 20:57:34,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-28 20:57:34,042 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-28 20:57:34,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-01-28 20:57:34,043 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 13 states. [2018-01-28 20:57:34,413 WARN L143 SmtUtils]: Spent 145ms on a formula simplification that was a NOOP. DAG size: 21 [2018-01-28 20:57:35,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 20:57:35,113 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2018-01-28 20:57:35,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-28 20:57:35,114 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-01-28 20:57:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 20:57:35,116 INFO L225 Difference]: With dead ends: 118 [2018-01-28 20:57:35,116 INFO L226 Difference]: Without dead ends: 117 [2018-01-28 20:57:35,118 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2018-01-28 20:57:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-28 20:57:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2018-01-28 20:57:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-01-28 20:57:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-01-28 20:57:35,129 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 40 [2018-01-28 20:57:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 20:57:35,130 INFO L432 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-01-28 20:57:35,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-28 20:57:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-01-28 20:57:35,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-28 20:57:35,131 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 20:57:35,131 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] [2018-01-28 20:57:35,131 INFO L371 AbstractCegarLoop]: === Iteration 10 === [build_nondet_StringErr0RequiresViolation, build_nondet_StringErr1RequiresViolation, cstrchrErr4RequiresViolation, cstrchrErr2RequiresViolation, cstrchrErr5RequiresViolation, cstrchrErr3RequiresViolation, cstrchrErr1RequiresViolation, cstrchrErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 20:57:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1229751552, now seen corresponding path program 1 times [2018-01-28 20:57:35,132 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 20:57:35,132 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 20:57:35,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:35,133 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 20:57:35,133 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 20:57:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 20:57:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-28 20:57:35,189 INFO L389 BasicCegarLoop]: Counterexample might be feasible [2018-01-28 20:57:35,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 08:57:35 BoogieIcfgContainer [2018-01-28 20:57:35,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 20:57:35,231 INFO L168 Benchmark]: Toolchain (without parser) took 8149.32 ms. Allocated memory was 303.0 MB in the beginning and 512.8 MB in the end (delta: 209.7 MB). Free memory was 263.1 MB in the beginning and 364.4 MB in the end (delta: -101.3 MB). Peak memory consumption was 108.4 MB. Max. memory is 5.3 GB. [2018-01-28 20:57:35,232 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 20:57:35,233 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.40 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. [2018-01-28 20:57:35,233 INFO L168 Benchmark]: Boogie Preprocessor took 44.52 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.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 20:57:35,233 INFO L168 Benchmark]: RCFGBuilder took 305.02 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 230.2 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. [2018-01-28 20:57:35,234 INFO L168 Benchmark]: TraceAbstraction took 7580.66 ms. Allocated memory was 303.0 MB in the beginning and 512.8 MB in the end (delta: 209.7 MB). Free memory was 230.2 MB in the beginning and 364.4 MB in the end (delta: -134.2 MB). Peak memory consumption was 75.5 MB. Max. memory is 5.3 GB. [2018-01-28 20:57:35,235 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 303.0 MB. Free memory is still 269.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.40 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 251.8 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.52 ms. Allocated memory is still 303.0 MB. Free memory was 251.8 MB in the beginning and 249.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 305.02 ms. Allocated memory is still 303.0 MB. Free memory was 249.8 MB in the beginning and 230.2 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 7580.66 ms. Allocated memory was 303.0 MB in the beginning and 512.8 MB in the end (delta: 209.7 MB). Free memory was 230.2 MB in the beginning and 364.4 MB in the end (delta: -134.2 MB). Peak memory consumption was 75.5 MB. Max. memory is 5.3 GB. * 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: [L556] CALL, EXPR build_nondet_String() [L541] int length = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=1, length=1] [L542] COND FALSE !(length < 1) VAL [length=1] [L545] EXPR, FCALL malloc(length * sizeof(char)) VAL [length=1, malloc(length * sizeof(char))={3:0}] [L545] char* nondetString = (char*) malloc(length * sizeof(char)); VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L546] FCALL nondetString[length-1] = '\0' VAL [length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L547] RET return nondetString; VAL [\result={3:0}, length=1, malloc(length * sizeof(char))={3:0}, nondetString={3:0}] [L556] EXPR build_nondet_String() VAL [build_nondet_String()={3:0}] [L556] char* s = build_nondet_String(); VAL [build_nondet_String()={3:0}, s={3:0}] [L557] CALL cstrchr(s,__VERIFIER_nondet_int()) VAL [\old(c)=1, s={3:0}] [L551] EXPR, FCALL \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L551] *s != '\0' && *s != (char)c VAL [*s != '\0' && *s != (char)c=0, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L551] COND FALSE !(*s != '\0' && *s != (char)c) VAL [*s != '\0' && *s != (char)c=0, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L553] EXPR, FCALL \read(*s) VAL [\old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L553] COND FALSE, EXPR !((*s == c) ? (char *) s : 0) VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=1, \read(*s)=0, c=1, s={3:0}, s={3:0}] [L553] RET return ( (*s == c) ? (char *) s : 0 ); VAL [(*s == c) ? (char *) s : 0={0:0}, \old(c)=1, \read(*s)=0, \result={0:0}, c=1, s={3:0}, s={3:0}] [L557] cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={3:0}] [L557] FCALL cstrchr(s,__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=1, cstrchr(s,__VERIFIER_nondet_int())={0:0}, s={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 73 locations, 13 error locations. UNSAFE Result, 7.5s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 546 SDtfs, 700 SDslu, 2413 SDs, 0 SdLazy, 1175 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=9, 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, 62 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 298 ConstructedInterpolants, 11 QuantifiedInterpolants, 53964 SizeOfPredicates, 14 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 4/8 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/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_20-57-35-256.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrchr_unsafe_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_20-57-35-256.csv Received shutdown request...