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_Taipan+AI_EQ_precise.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 23:08:47,418 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 23:08:47,419 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 23:08:47,435 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 23:08:47,435 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 23:08:47,437 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 23:08:47,438 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 23:08:47,439 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 23:08:47,441 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 23:08:47,442 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 23:08:47,443 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 23:08:47,444 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 23:08:47,444 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 23:08:47,446 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 23:08:47,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 23:08:47,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 23:08:47,452 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 23:08:47,454 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 23:08:47,455 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 23:08:47,456 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 23:08:47,459 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 23:08:47,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 23:08:47,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 23:08:47,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 23:08:47,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 23:08:47,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 23:08:47,463 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 23:08:47,464 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 23:08:47,464 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 23:08:47,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 23:08:47,465 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 23:08:47,466 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf [2018-01-24 23:08:47,474 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 23:08:47,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 23:08:47,475 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 23:08:47,475 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 23:08:47,476 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 23:08:47,476 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 23:08:47,476 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 23:08:47,476 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 23:08:47,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 23:08:47,477 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 23:08:47,477 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 23:08:47,477 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 23:08:47,477 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 23:08:47,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 23:08:47,477 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 23:08:47,478 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 23:08:47,478 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 23:08:47,478 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 23:08:47,478 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 23:08:47,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 23:08:47,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 23:08:47,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 23:08:47,479 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 23:08:47,479 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 23:08:47,479 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:08:47,479 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 23:08:47,479 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 23:08:47,479 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 23:08:47,480 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 23:08:47,480 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 23:08:47,480 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 23:08:47,480 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 23:08:47,480 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 23:08:47,480 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 23:08:47,481 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 23:08:47,481 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 23:08:47,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 23:08:47,526 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 23:08:47,530 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 23:08:47,531 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 23:08:47,531 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 23:08:47,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:08:47,688 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 23:08:47,693 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 23:08:47,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 23:08:47,693 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 23:08:47,698 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 23:08:47,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:08:47" (1/1) ... [2018-01-24 23:08:47,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b029a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47, skipping insertion in model container [2018-01-24 23:08:47,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 11:08:47" (1/1) ... [2018-01-24 23:08:47,716 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:08:47,752 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 23:08:47,872 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:08:47,893 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 23:08:47,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47 WrapperNode [2018-01-24 23:08:47,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 23:08:47,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 23:08:47,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 23:08:47,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 23:08:47,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47" (1/1) ... [2018-01-24 23:08:47,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47" (1/1) ... [2018-01-24 23:08:47,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47" (1/1) ... [2018-01-24 23:08:47,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47" (1/1) ... [2018-01-24 23:08:47,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47" (1/1) ... [2018-01-24 23:08:47,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47" (1/1) ... [2018-01-24 23:08:47,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47" (1/1) ... [2018-01-24 23:08:47,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 23:08:47,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 23:08:47,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 23:08:47,939 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 23:08:47,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 23:08:47,990 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 23:08:47,990 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 23:08:47,990 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcmp [2018-01-24 23:08:47,990 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 23:08:47,991 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 23:08:47,991 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 23:08:47,991 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 23:08:47,991 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 23:08:47,991 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 23:08:47,991 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 23:08:47,992 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcmp [2018-01-24 23:08:47,992 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 23:08:47,992 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 23:08:47,992 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 23:08:48,218 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 23:08:48,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:08:48 BoogieIcfgContainer [2018-01-24 23:08:48,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 23:08:48,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 23:08:48,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 23:08:48,222 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 23:08:48,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 11:08:47" (1/3) ... [2018-01-24 23:08:48,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e6e930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:08:48, skipping insertion in model container [2018-01-24 23:08:48,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 11:08:47" (2/3) ... [2018-01-24 23:08:48,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e6e930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 11:08:48, skipping insertion in model container [2018-01-24 23:08:48,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 11:08:48" (3/3) ... [2018-01-24 23:08:48,225 INFO L105 eAbstractionObserver]: Analyzing ICFG cstrcmp-alloca_true-valid-memsafety_true-termination.i [2018-01-24 23:08:48,231 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 23:08:48,237 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-01-24 23:08:48,277 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 23:08:48,278 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 23:08:48,278 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 23:08:48,278 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 23:08:48,278 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 23:08:48,278 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 23:08:48,278 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 23:08:48,279 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 23:08:48,279 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 23:08:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-01-24 23:08:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:08:48,309 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:48,310 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:08:48,311 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:48,316 INFO L82 PathProgramCache]: Analyzing trace with hash 286131230, now seen corresponding path program 1 times [2018-01-24 23:08:48,319 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:48,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:48,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:48,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:48,362 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:48,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:08:48,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:48,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:08:48,586 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:48,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:08:48,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:08:48,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:08:48,671 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 4 states. [2018-01-24 23:08:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:48,824 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-01-24 23:08:48,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:08:48,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-01-24 23:08:48,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:48,841 INFO L225 Difference]: With dead ends: 78 [2018-01-24 23:08:48,841 INFO L226 Difference]: Without dead ends: 52 [2018-01-24 23:08:48,844 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:08:48,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-24 23:08:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-24 23:08:48,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-24 23:08:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-01-24 23:08:48,876 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 13 [2018-01-24 23:08:48,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:48,876 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-01-24 23:08:48,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:08:48,877 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-01-24 23:08:48,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 23:08:48,877 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:48,877 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:08:48,877 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:48,878 INFO L82 PathProgramCache]: Analyzing trace with hash 286131231, now seen corresponding path program 1 times [2018-01-24 23:08:48,878 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:48,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:48,879 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:48,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:48,879 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:48,895 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:08:49,047 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:49,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 23:08:49,047 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:49,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 23:08:49,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 23:08:49,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:08:49,050 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-01-24 23:08:49,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:49,133 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-01-24 23:08:49,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:08:49,133 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-01-24 23:08:49,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:49,134 INFO L225 Difference]: With dead ends: 52 [2018-01-24 23:08:49,134 INFO L226 Difference]: Without dead ends: 51 [2018-01-24 23:08:49,135 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-24 23:08:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-24 23:08:49,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-01-24 23:08:49,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-24 23:08:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-01-24 23:08:49,142 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 13 [2018-01-24 23:08:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:49,143 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-01-24 23:08:49,143 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 23:08:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-01-24 23:08:49,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:08:49,144 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:49,144 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:08:49,144 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash 280133580, now seen corresponding path program 1 times [2018-01-24 23:08:49,144 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:49,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,145 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:49,145 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,145 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:49,155 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:49,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-24 23:08:49,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:49,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:08:49,179 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:49,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 23:08:49,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 23:08:49,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 23:08:49,180 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2018-01-24 23:08:49,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:49,310 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-01-24 23:08:49,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 23:08:49,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-24 23:08:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:49,311 INFO L225 Difference]: With dead ends: 51 [2018-01-24 23:08:49,311 INFO L226 Difference]: Without dead ends: 50 [2018-01-24 23:08:49,312 INFO L525 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-24 23:08:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-24 23:08:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-24 23:08:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 23:08:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-01-24 23:08:49,318 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 14 [2018-01-24 23:08:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:49,319 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-01-24 23:08:49,319 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 23:08:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-01-24 23:08:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 23:08:49,320 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:49,320 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:08:49,320 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash 280133581, now seen corresponding path program 1 times [2018-01-24 23:08:49,320 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:49,321 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,321 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:49,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,322 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:49,335 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:08:49,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:49,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:08:49,409 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:49,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:08:49,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:08:49,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:08:49,409 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 5 states. [2018-01-24 23:08:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:49,446 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-01-24 23:08:49,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 23:08:49,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 23:08:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:49,448 INFO L225 Difference]: With dead ends: 50 [2018-01-24 23:08:49,448 INFO L226 Difference]: Without dead ends: 49 [2018-01-24 23:08:49,448 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:08:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-24 23:08:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-01-24 23:08:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-24 23:08:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-01-24 23:08:49,452 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 14 [2018-01-24 23:08:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:49,452 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-01-24 23:08:49,453 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:08:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-01-24 23:08:49,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:08:49,453 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:49,453 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:08:49,453 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531033, now seen corresponding path program 1 times [2018-01-24 23:08:49,454 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:49,454 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:49,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,455 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:49,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:08:49,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:49,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:08:49,506 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:49,506 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:08:49,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:08:49,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:08:49,507 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 5 states. [2018-01-24 23:08:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:49,589 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-01-24 23:08:49,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:08:49,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 23:08:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:49,590 INFO L225 Difference]: With dead ends: 49 [2018-01-24 23:08:49,591 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 23:08:49,591 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:08:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 23:08:49,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 23:08:49,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 23:08:49,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-01-24 23:08:49,597 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-01-24 23:08:49,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:49,598 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-01-24 23:08:49,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:08:49,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-01-24 23:08:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 23:08:49,599 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:49,599 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:08:49,599 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:49,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1890531034, now seen corresponding path program 1 times [2018-01-24 23:08:49,599 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:49,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:49,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,601 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:49,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:08:49,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:49,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:08:49,718 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:49,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:08:49,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:08:49,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:08:49,719 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-01-24 23:08:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:49,826 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2018-01-24 23:08:49,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 23:08:49,826 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-01-24 23:08:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:49,829 INFO L225 Difference]: With dead ends: 69 [2018-01-24 23:08:49,829 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 23:08:49,829 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:08:49,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 23:08:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-01-24 23:08:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 23:08:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-01-24 23:08:49,836 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 18 [2018-01-24 23:08:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:49,837 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-01-24 23:08:49,837 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:08:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-01-24 23:08:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:08:49,838 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:49,838 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:08:49,838 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:49,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951649, now seen corresponding path program 1 times [2018-01-24 23:08:49,839 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:49,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:49,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:49,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:08:49,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:49,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 23:08:49,888 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:49,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 23:08:49,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 23:08:49,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 23:08:49,889 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 5 states. [2018-01-24 23:08:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:49,973 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-01-24 23:08:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 23:08:49,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-24 23:08:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:49,976 INFO L225 Difference]: With dead ends: 55 [2018-01-24 23:08:49,976 INFO L226 Difference]: Without dead ends: 53 [2018-01-24 23:08:49,977 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 23:08:49,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-24 23:08:49,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-24 23:08:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-24 23:08:49,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-01-24 23:08:49,982 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 22 [2018-01-24 23:08:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:49,982 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-01-24 23:08:49,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 23:08:49,982 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-01-24 23:08:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 23:08:49,983 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:49,983 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 23:08:49,983 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:49,983 INFO L82 PathProgramCache]: Analyzing trace with hash -2045951648, now seen corresponding path program 1 times [2018-01-24 23:08:49,983 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:49,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,984 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:49,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:49,984 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:49,995 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 23:08:50,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:50,108 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 23:08:50,109 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:50,109 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 23:08:50,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 23:08:50,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-01-24 23:08:50,110 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 8 states. [2018-01-24 23:08:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:50,199 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-01-24 23:08:50,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 23:08:50,202 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-24 23:08:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:50,203 INFO L225 Difference]: With dead ends: 62 [2018-01-24 23:08:50,203 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 23:08:50,204 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 23:08:50,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 23:08:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2018-01-24 23:08:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 23:08:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2018-01-24 23:08:50,210 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 22 [2018-01-24 23:08:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:50,211 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2018-01-24 23:08:50,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 23:08:50,211 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2018-01-24 23:08:50,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 23:08:50,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:50,212 INFO L322 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] [2018-01-24 23:08:50,212 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:50,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1000289501, now seen corresponding path program 1 times [2018-01-24 23:08:50,213 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:50,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:50,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:50,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:50,214 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:50,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:50,242 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-24 23:08:50,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:50,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 23:08:50,242 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:50,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 23:08:50,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 23:08:50,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 23:08:50,243 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand 3 states. [2018-01-24 23:08:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:50,250 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-01-24 23:08:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 23:08:50,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-24 23:08:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:50,251 INFO L225 Difference]: With dead ends: 85 [2018-01-24 23:08:50,251 INFO L226 Difference]: Without dead ends: 57 [2018-01-24 23:08:50,251 INFO L525 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-24 23:08:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-24 23:08:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-24 23:08:50,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 23:08:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-01-24 23:08:50,256 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 23 [2018-01-24 23:08:50,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:50,256 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-01-24 23:08:50,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 23:08:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-01-24 23:08:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:08:50,257 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:50,257 INFO L322 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] [2018-01-24 23:08:50,257 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:50,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1354456010, now seen corresponding path program 1 times [2018-01-24 23:08:50,257 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:50,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:50,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:50,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:50,258 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:50,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:50,564 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-24 23:08:50,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 23:08:50,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 23:08:50,602 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 23:08:50,602 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-24 23:08:50,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-24 23:08:50,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-01-24 23:08:50,603 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 12 states. [2018-01-24 23:08:50,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 23:08:50,925 INFO L93 Difference]: Finished difference Result 122 states and 133 transitions. [2018-01-24 23:08:50,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 23:08:50,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-01-24 23:08:50,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 23:08:50,926 INFO L225 Difference]: With dead ends: 122 [2018-01-24 23:08:50,926 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 23:08:50,927 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2018-01-24 23:08:50,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 23:08:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2018-01-24 23:08:50,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-24 23:08:50,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2018-01-24 23:08:50,936 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 26 [2018-01-24 23:08:50,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 23:08:50,937 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2018-01-24 23:08:50,937 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-24 23:08:50,937 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2018-01-24 23:08:50,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 23:08:50,938 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 23:08:50,938 INFO L322 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] [2018-01-24 23:08:50,938 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcmpErr0RequiresViolation, cstrcmpErr9RequiresViolation, cstrcmpErr4RequiresViolation, cstrcmpErr7RequiresViolation, cstrcmpErr5RequiresViolation, cstrcmpErr6RequiresViolation, cstrcmpErr1RequiresViolation, cstrcmpErr3RequiresViolation, cstrcmpErr2RequiresViolation, cstrcmpErr8RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 23:08:50,938 INFO L82 PathProgramCache]: Analyzing trace with hash 536807560, now seen corresponding path program 1 times [2018-01-24 23:08:50,939 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 23:08:50,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:50,940 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:08:50,940 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 23:08:50,940 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 23:08:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:08:50,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 23:08:51,324 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-24 23:08:51,325 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:08:51,325 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 23:08:51,326 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-01-24 23:08:51,327 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [8], [10], [11], [14], [15], [18], [21], [29], [52], [57], [61], [65], [66], [67], [68], [69], [72], [83], [84], [85], [87] [2018-01-24 23:08:51,374 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 23:08:51,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-24 23:09:52,610 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-24 23:09:52,610 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-24 23:09:52,611 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-24 23:09:52,611 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 23:09:52,611 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 23:09:52,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 23:09:52,618 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 23:09:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 23:09:52,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 23:09:52,684 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-24 23:09:52,685 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 23:09:52,691 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 23:09:52,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 11:09:52 BoogieIcfgContainer [2018-01-24 23:09:52,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 23:09:52,693 INFO L168 Benchmark]: Toolchain (without parser) took 65005.20 ms. Allocated memory was 317.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 276.1 MB in the beginning and 734.2 MB in the end (delta: -458.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-24 23:09:52,695 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 317.2 MB. Free memory is still 282.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 23:09:52,695 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.14 ms. Allocated memory is still 317.2 MB. Free memory was 276.1 MB in the beginning and 266.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-24 23:09:52,696 INFO L168 Benchmark]: Boogie Preprocessor took 36.23 ms. Allocated memory is still 317.2 MB. Free memory was 266.0 MB in the beginning and 264.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:09:52,697 INFO L168 Benchmark]: RCFGBuilder took 280.97 ms. Allocated memory is still 317.2 MB. Free memory was 264.0 MB in the beginning and 245.0 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. [2018-01-24 23:09:52,697 INFO L168 Benchmark]: TraceAbstraction took 64472.30 ms. Allocated memory was 317.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 245.0 MB in the beginning and 734.2 MB in the end (delta: -489.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-24 23:09:52,699 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 317.2 MB. Free memory is still 282.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.14 ms. Allocated memory is still 317.2 MB. Free memory was 276.1 MB in the beginning and 266.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.23 ms. Allocated memory is still 317.2 MB. Free memory was 266.0 MB in the beginning and 264.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 280.97 ms. Allocated memory is still 317.2 MB. Free memory was 264.0 MB in the beginning and 245.0 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 64472.30 ms. Allocated memory was 317.2 MB in the beginning and 2.0 GB in the end (delta: 1.7 GB). Free memory was 245.0 MB in the beginning and 734.2 MB in the end (delta: -489.2 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 563). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 562). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 551). Cancelled while BasicCegarLoop was analyzing trace of length 27 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 14 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 15 error locations. TIMEOUT Result, 64.4s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 411 SDtfs, 405 SDslu, 723 SDs, 0 SdLazy, 506 SolverSat, 69 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 61.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 23 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 12817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_23-09-52-713.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_precise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_23-09-52-713.csv Completed graceful shutdown