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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:47:39,374 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:47:39,375 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:47:39,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:47:39,387 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:47:39,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:47:39,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:47:39,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:47:39,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:47:39,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:47:39,394 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:47:39,394 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:47:39,395 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:47:39,396 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:47:39,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:47:39,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:47:39,400 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:47:39,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:47:39,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:47:39,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:47:39,411 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:47:39,411 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:47:39,415 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:47:39,416 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:47:39,417 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:47:39,417 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:47:39,418 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:47:39,418 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:47:39,418 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:47:39,423 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:47:39,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:47:39,424 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:47:39,442 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:47:39,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:47:39,445 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:47:39,445 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:47:39,445 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:47:39,446 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:47:39,446 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:47:39,446 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:47:39,446 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:47:39,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:47:39,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:47:39,447 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:47:39,447 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:47:39,447 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:47:39,447 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:47:39,447 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:47:39,447 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:47:39,448 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:47:39,448 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:47:39,448 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:47:39,448 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:47:39,448 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:47:39,448 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:47:39,448 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:47:39,449 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:47:39,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:47:39,491 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:47:39,494 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:47:39,500 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:47:39,501 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:47:39,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:47:39,650 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:47:39,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:47:39,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:39,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:47:39,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:47:39,662 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:39" (1/1) ... [2018-02-03 22:47:39,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f51d34c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39, skipping insertion in model container [2018-02-03 22:47:39,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:47:39" (1/1) ... [2018-02-03 22:47:39,685 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:39,735 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:47:39,838 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:39,849 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:47:39,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39 WrapperNode [2018-02-03 22:47:39,855 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:47:39,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:47:39,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:47:39,856 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:47:39,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39" (1/1) ... [2018-02-03 22:47:39,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39" (1/1) ... [2018-02-03 22:47:39,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39" (1/1) ... [2018-02-03 22:47:39,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39" (1/1) ... [2018-02-03 22:47:39,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39" (1/1) ... [2018-02-03 22:47:39,884 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39" (1/1) ... [2018-02-03 22:47:39,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39" (1/1) ... [2018-02-03 22:47:39,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:47:39,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:47:39,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:47:39,887 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:47:39,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-03 22:47:39,922 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:47:39,922 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:47:39,922 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-03 22:47:39,922 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:47:39,922 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:47:39,922 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:47:39,922 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:47:39,923 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:47:39,923 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:47:39,923 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:47:39,923 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-03 22:47:39,923 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:47:39,923 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:47:39,923 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:47:40,237 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:47:40,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:40 BoogieIcfgContainer [2018-02-03 22:47:40,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:47:40,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:47:40,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:47:40,241 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:47:40,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:47:39" (1/3) ... [2018-02-03 22:47:40,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779955af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:40, skipping insertion in model container [2018-02-03 22:47:40,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:47:39" (2/3) ... [2018-02-03 22:47:40,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779955af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:47:40, skipping insertion in model container [2018-02-03 22:47:40,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:47:40" (3/3) ... [2018-02-03 22:47:40,244 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:47:40,249 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:47:40,254 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-03 22:47:40,280 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:47:40,280 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:47:40,281 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:47:40,281 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:47:40,281 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:47:40,281 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:47:40,281 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:47:40,281 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:47:40,282 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:47:40,291 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-02-03 22:47:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:47:40,300 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:40,301 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:40,302 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:40,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029996, now seen corresponding path program 1 times [2018-02-03 22:47:40,308 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:40,308 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:40,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,350 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:40,350 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:40,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:40,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-02-03 22:47:40,548 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:40,548 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:40,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:47:40,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:47:40,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:47:40,560 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-02-03 22:47:40,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:40,880 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-03 22:47:40,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:47:40,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-03 22:47:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:40,887 INFO L225 Difference]: With dead ends: 60 [2018-02-03 22:47:40,887 INFO L226 Difference]: Without dead ends: 57 [2018-02-03 22:47:40,889 INFO L554 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-02-03 22:47:40,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-03 22:47:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-03 22:47:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-03 22:47:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-02-03 22:47:40,911 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-02-03 22:47:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:40,912 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-02-03 22:47:40,912 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:47:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-02-03 22:47:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:47:40,912 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:40,912 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:40,912 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:40,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029997, now seen corresponding path program 1 times [2018-02-03 22:47:40,913 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:40,913 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:40,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,913 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:40,913 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:40,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:41,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:41,022 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:41,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:41,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:41,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:41,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:41,024 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-02-03 22:47:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:41,120 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-02-03 22:47:41,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:41,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-03 22:47:41,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:41,122 INFO L225 Difference]: With dead ends: 56 [2018-02-03 22:47:41,122 INFO L226 Difference]: Without dead ends: 56 [2018-02-03 22:47:41,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:47:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-03 22:47:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-03 22:47:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-03 22:47:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-03 22:47:41,128 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-02-03 22:47:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:41,128 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-03 22:47:41,128 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-03 22:47:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:47:41,129 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:41,129 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:41,129 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:41,129 INFO L82 PathProgramCache]: Analyzing trace with hash -684644977, now seen corresponding path program 1 times [2018-02-03 22:47:41,130 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:41,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:41,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,131 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:41,131 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:41,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:41,171 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:41,171 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:41,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:47:41,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:47:41,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:47:41,172 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-02-03 22:47:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:41,265 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-02-03 22:47:41,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:47:41,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:47:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:41,267 INFO L225 Difference]: With dead ends: 55 [2018-02-03 22:47:41,267 INFO L226 Difference]: Without dead ends: 55 [2018-02-03 22:47:41,267 INFO L554 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-02-03 22:47:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-03 22:47:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-03 22:47:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-03 22:47:41,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-02-03 22:47:41,272 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-02-03 22:47:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:41,272 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-02-03 22:47:41,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:47:41,272 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-02-03 22:47:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:47:41,273 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:41,273 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:41,273 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:41,273 INFO L82 PathProgramCache]: Analyzing trace with hash -684644976, now seen corresponding path program 1 times [2018-02-03 22:47:41,273 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:41,273 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:41,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,274 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:41,274 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:41,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:41,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:41,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:41,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:41,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:41,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:41,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:41,392 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-02-03 22:47:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:41,452 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-03 22:47:41,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:47:41,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:47:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:41,454 INFO L225 Difference]: With dead ends: 54 [2018-02-03 22:47:41,454 INFO L226 Difference]: Without dead ends: 54 [2018-02-03 22:47:41,454 INFO L554 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-02-03 22:47:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-03 22:47:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-03 22:47:41,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:47:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-02-03 22:47:41,458 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-02-03 22:47:41,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:41,459 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-02-03 22:47:41,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-02-03 22:47:41,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:47:41,460 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:41,460 INFO L351 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-02-03 22:47:41,460 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:41,460 INFO L82 PathProgramCache]: Analyzing trace with hash 518960417, now seen corresponding path program 1 times [2018-02-03 22:47:41,460 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:41,460 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:41,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,461 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:41,461 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:41,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:41,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:41,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:41,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:41,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:41,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:41,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:41,519 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-02-03 22:47:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:41,576 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-02-03 22:47:41,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:47:41,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-03 22:47:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:41,577 INFO L225 Difference]: With dead ends: 51 [2018-02-03 22:47:41,577 INFO L226 Difference]: Without dead ends: 51 [2018-02-03 22:47:41,577 INFO L554 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-02-03 22:47:41,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-03 22:47:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-03 22:47:41,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:47:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-03 22:47:41,581 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-02-03 22:47:41,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:41,581 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-03 22:47:41,581 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-03 22:47:41,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:47:41,582 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:41,582 INFO L351 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-02-03 22:47:41,582 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:41,582 INFO L82 PathProgramCache]: Analyzing trace with hash 518960418, now seen corresponding path program 1 times [2018-02-03 22:47:41,582 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:41,582 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:41,583 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,583 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:41,584 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:41,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:41,691 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:41,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:47:41,692 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:47:41,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:47:41,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:47:41,693 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-02-03 22:47:41,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:41,790 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-03 22:47:41,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:47:41,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-03 22:47:41,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:41,802 INFO L225 Difference]: With dead ends: 74 [2018-02-03 22:47:41,802 INFO L226 Difference]: Without dead ends: 74 [2018-02-03 22:47:41,803 INFO L554 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-02-03 22:47:41,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-03 22:47:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-02-03 22:47:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-03 22:47:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-02-03 22:47:41,806 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-02-03 22:47:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:41,806 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-02-03 22:47:41,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:47:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-02-03 22:47:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:47:41,807 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:41,807 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:41,807 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:41,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096233, now seen corresponding path program 1 times [2018-02-03 22:47:41,808 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:41,808 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:41,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,808 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:41,808 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:41,817 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:41,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:41,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:47:41,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:47:41,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:47:41,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:47:41,849 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-02-03 22:47:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:41,913 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-02-03 22:47:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:47:41,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-03 22:47:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:41,914 INFO L225 Difference]: With dead ends: 59 [2018-02-03 22:47:41,914 INFO L226 Difference]: Without dead ends: 59 [2018-02-03 22:47:41,914 INFO L554 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-02-03 22:47:41,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-03 22:47:41,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-03 22:47:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-03 22:47:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-02-03 22:47:41,917 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-02-03 22:47:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:41,918 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-02-03 22:47:41,918 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:47:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-02-03 22:47:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-03 22:47:41,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:41,919 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:41,919 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:41,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096232, now seen corresponding path program 1 times [2018-02-03 22:47:41,919 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:41,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:41,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,920 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:41,920 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:41,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:42,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:42,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:47:42,008 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:47:42,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:47:42,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:47:42,008 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-02-03 22:47:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:42,094 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-02-03 22:47:42,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:47:42,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-03 22:47:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:42,096 INFO L225 Difference]: With dead ends: 68 [2018-02-03 22:47:42,096 INFO L226 Difference]: Without dead ends: 68 [2018-02-03 22:47:42,096 INFO L554 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-02-03 22:47:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-03 22:47:42,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-02-03 22:47:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-03 22:47:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-02-03 22:47:42,100 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-02-03 22:47:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:42,100 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-02-03 22:47:42,100 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:47:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-02-03 22:47:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:47:42,101 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:42,101 INFO L351 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] [2018-02-03 22:47:42,101 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2118091962, now seen corresponding path program 1 times [2018-02-03 22:47:42,101 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:42,101 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:42,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,102 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:42,102 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:42,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:42,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:42,209 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:42,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:47:42,210 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:47:42,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:47:42,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:47:42,210 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2018-02-03 22:47:42,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:42,330 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-02-03 22:47:42,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:47:42,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-03 22:47:42,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:42,331 INFO L225 Difference]: With dead ends: 60 [2018-02-03 22:47:42,331 INFO L226 Difference]: Without dead ends: 46 [2018-02-03 22:47:42,332 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:47:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-03 22:47:42,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-03 22:47:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-03 22:47:42,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-03 22:47:42,335 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-02-03 22:47:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:42,336 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-03 22:47:42,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:47:42,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-03 22:47:42,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-03 22:47:42,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:42,337 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:42,337 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:42,337 INFO L82 PathProgramCache]: Analyzing trace with hash 487859445, now seen corresponding path program 1 times [2018-02-03 22:47:42,337 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:42,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:42,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,338 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:42,338 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:42,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:42,368 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:42,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:42,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:47:42,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:47:42,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:47:42,369 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-02-03 22:47:42,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:42,373 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-03 22:47:42,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:47:42,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-03 22:47:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:42,375 INFO L225 Difference]: With dead ends: 48 [2018-02-03 22:47:42,375 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 22:47:42,375 INFO L554 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-02-03 22:47:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 22:47:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-03 22:47:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:47:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-03 22:47:42,378 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-02-03 22:47:42,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:42,378 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-03 22:47:42,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:47:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-03 22:47:42,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:47:42,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:42,379 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:42,379 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:42,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1854244690, now seen corresponding path program 1 times [2018-02-03 22:47:42,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:42,380 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:42,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:42,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:42,390 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:42,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:42,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:47:42,404 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 22:47:42,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 22:47:42,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 22:47:42,404 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-02-03 22:47:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:42,408 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-03 22:47:42,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 22:47:42,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-02-03 22:47:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:42,409 INFO L225 Difference]: With dead ends: 48 [2018-02-03 22:47:42,409 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 22:47:42,410 INFO L554 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-02-03 22:47:42,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 22:47:42,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-03 22:47:42,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:47:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-02-03 22:47:42,412 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-02-03 22:47:42,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:42,412 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-02-03 22:47:42,412 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 22:47:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-02-03 22:47:42,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 22:47:42,413 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:42,413 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:42,413 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:42,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2022484201, now seen corresponding path program 1 times [2018-02-03 22:47:42,414 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:42,414 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:42,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:42,415 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:42,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:42,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:47:42,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-03 22:47:42,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:47:42,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:47:42,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:47:42,590 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-02-03 22:47:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:42,791 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-02-03 22:47:42,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:47:42,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-03 22:47:42,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:42,792 INFO L225 Difference]: With dead ends: 69 [2018-02-03 22:47:42,792 INFO L226 Difference]: Without dead ends: 47 [2018-02-03 22:47:42,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-02-03 22:47:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-03 22:47:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-03 22:47:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-03 22:47:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-02-03 22:47:42,793 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-02-03 22:47:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:42,793 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-02-03 22:47:42,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:47:42,793 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-02-03 22:47:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 22:47:42,794 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:42,794 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:42,794 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:42,794 INFO L82 PathProgramCache]: Analyzing trace with hash -349255061, now seen corresponding path program 1 times [2018-02-03 22:47:42,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:42,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:42,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,795 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:42,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:42,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:42,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:42,999 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/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-02-03 22:47:43,004 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:43,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:43,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:43,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:43,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:43,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:47:43,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:43,091 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:43,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:47:43,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:43,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:43,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:47:43,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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-02-03 22:47:43,134 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-02-03 22:47:43,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:43,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:43,149 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-02-03 22:47:43,149 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:47:43,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-03 22:47:43,184 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-02-03 22:47:43,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:43,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:43,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 22:47:43,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-03 22:47:43,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-03 22:47:43,354 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-02-03 22:47:43,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:43,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 22:47:43,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:43,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:43,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:43,369 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-02-03 22:47:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:43,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:43,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-02-03 22:47:43,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-03 22:47:43,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-03 22:47:43,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:47:43,460 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 24 states. [2018-02-03 22:47:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:44,005 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-02-03 22:47:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:47:44,005 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-02-03 22:47:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:44,006 INFO L225 Difference]: With dead ends: 66 [2018-02-03 22:47:44,006 INFO L226 Difference]: Without dead ends: 66 [2018-02-03 22:47:44,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:47:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-03 22:47:44,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-02-03 22:47:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-03 22:47:44,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-03 22:47:44,008 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 33 [2018-02-03 22:47:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:44,009 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-03 22:47:44,009 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-03 22:47:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-03 22:47:44,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-03 22:47:44,009 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:44,009 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:44,010 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:44,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2057994991, now seen corresponding path program 1 times [2018-02-03 22:47:44,010 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:44,010 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:44,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:44,011 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:44,011 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:44,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:44,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:44,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:44,201 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:47:44,206 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:44,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:44,227 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-02-03 22:47:44,228 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-02-03 22:47:44,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:44,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:44,233 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-02-03 22:47:44,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:47:44,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-02-03 22:47:44,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2018-02-03 22:47:44,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:44,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-02-03 22:47:44,516 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:44,534 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 18 treesize of output 16 [2018-02-03 22:47:44,535 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:44,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:47:44,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:44,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2018-02-03 22:47:44,652 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:44,677 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:44,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-02-03 22:47:44,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-03 22:47:44,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-03 22:47:44,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-02-03 22:47:44,678 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 24 states. [2018-02-03 22:47:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:45,260 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-03 22:47:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:47:45,261 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-02-03 22:47:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:45,261 INFO L225 Difference]: With dead ends: 64 [2018-02-03 22:47:45,261 INFO L226 Difference]: Without dead ends: 60 [2018-02-03 22:47:45,262 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2018-02-03 22:47:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-03 22:47:45,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-02-03 22:47:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-03 22:47:45,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-02-03 22:47:45,264 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 34 [2018-02-03 22:47:45,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:45,264 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-02-03 22:47:45,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-03 22:47:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-02-03 22:47:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-03 22:47:45,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:45,265 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:45,265 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:45,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1216715776, now seen corresponding path program 2 times [2018-02-03 22:47:45,265 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:45,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:45,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:45,266 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:47:45,266 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:45,278 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:45,564 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:45,564 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:45,565 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:47:45,571 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:47:45,588 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:47:45,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:47:45,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:45,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:45,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:45,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:47:45,624 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:45,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 22:47:45,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:45,630 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:47:45,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:47:45,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:47:45,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:47:45,673 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 13 treesize of output 12 [2018-02-03 22:47:45,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-03 22:47:45,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-03 22:47:45,716 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 13 treesize of output 12 [2018-02-03 22:47:45,716 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 22:47:45,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-02-03 22:47:45,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-02-03 22:47:45,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-03 22:47:45,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:45,927 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 16 treesize of output 13 [2018-02-03 22:47:45,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:45,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:45,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:45,936 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-02-03 22:47:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:46,029 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:46,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-02-03 22:47:46,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 22:47:46,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 22:47:46,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:47:46,029 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 26 states. [2018-02-03 22:47:47,179 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 71 DAG size of output 52 [2018-02-03 22:47:49,257 WARN L146 SmtUtils]: Spent 2052ms on a formula simplification. DAG size of input: 76 DAG size of output 56 [2018-02-03 22:47:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:49,565 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-02-03 22:47:49,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-03 22:47:49,565 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-02-03 22:47:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:49,565 INFO L225 Difference]: With dead ends: 57 [2018-02-03 22:47:49,565 INFO L226 Difference]: Without dead ends: 57 [2018-02-03 22:47:49,566 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2018-02-03 22:47:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-03 22:47:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-02-03 22:47:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:47:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-03 22:47:49,567 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 44 [2018-02-03 22:47:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:49,567 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-03 22:47:49,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 22:47:49,568 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-03 22:47:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-03 22:47:49,568 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:47:49,568 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:47:49,568 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:47:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash -936516614, now seen corresponding path program 2 times [2018-02-03 22:47:49,568 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:47:49,568 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:47:49,569 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:49,569 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:47:49,569 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:47:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:47:49,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:47:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:49,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:47:49,923 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:47:49,929 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:47:49,945 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:47:49,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:47:49,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:47:49,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:47:49,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:49,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:49,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:47:49,986 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 16 treesize of output 13 [2018-02-03 22:47:49,987 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 13 treesize of output 12 [2018-02-03 22:47:49,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:49,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:49,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:47:49,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-03 22:47:50,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-02-03 22:47:50,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 25 [2018-02-03 22:47:50,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:50,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-02-03 22:47:50,147 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:47:50,166 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 19 treesize of output 17 [2018-02-03 22:47:50,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-03 22:47:50,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:47:50,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:47:50,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-02-03 22:47:50,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:47:50,269 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:47:50,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-02-03 22:47:50,270 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-03 22:47:50,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-03 22:47:50,270 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-03 22:47:50,270 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 26 states. [2018-02-03 22:47:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:47:50,958 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-02-03 22:47:50,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-03 22:47:50,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-02-03 22:47:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:47:50,959 INFO L225 Difference]: With dead ends: 55 [2018-02-03 22:47:50,959 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:47:50,960 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2018-02-03 22:47:50,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:47:50,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:47:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:47:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:47:50,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-02-03 22:47:50,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:47:50,960 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:47:50,960 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-03 22:47:50,960 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:47:50,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:47:50,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:47:50 BoogieIcfgContainer [2018-02-03 22:47:50,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:47:50,964 INFO L168 Benchmark]: Toolchain (without parser) took 11312.54 ms. Allocated memory was 395.8 MB in the beginning and 735.6 MB in the end (delta: 339.7 MB). Free memory was 352.7 MB in the beginning and 608.2 MB in the end (delta: -255.4 MB). Peak memory consumption was 84.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:50,965 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 395.8 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:47:50,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.94 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 342.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:50,965 INFO L168 Benchmark]: Boogie Preprocessor took 31.07 ms. Allocated memory is still 395.8 MB. Free memory was 342.1 MB in the beginning and 339.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:50,965 INFO L168 Benchmark]: RCFGBuilder took 351.37 ms. Allocated memory is still 395.8 MB. Free memory was 339.5 MB in the beginning and 317.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:50,965 INFO L168 Benchmark]: TraceAbstraction took 10724.97 ms. Allocated memory was 395.8 MB in the beginning and 735.6 MB in the end (delta: 339.7 MB). Free memory was 317.5 MB in the beginning and 608.2 MB in the end (delta: -290.6 MB). Peak memory consumption was 49.1 MB. Max. memory is 5.3 GB. [2018-02-03 22:47:50,966 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 395.8 MB. Free memory is still 358.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 201.94 ms. Allocated memory is still 395.8 MB. Free memory was 352.7 MB in the beginning and 342.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.07 ms. Allocated memory is still 395.8 MB. Free memory was 342.1 MB in the beginning and 339.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 351.37 ms. Allocated memory is still 395.8 MB. Free memory was 339.5 MB in the beginning and 317.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10724.97 ms. Allocated memory was 395.8 MB in the beginning and 735.6 MB in the end (delta: 339.7 MB). Free memory was 317.5 MB in the beginning and 608.2 MB in the end (delta: -290.6 MB). Peak memory consumption was 49.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 15 error locations. SAFE Result, 10.6s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 670 SDtfs, 1049 SDslu, 2531 SDs, 0 SdLazy, 2222 SolverSat, 133 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 345 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 32 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 554 ConstructedInterpolants, 51 QuantifiedInterpolants, 243997 SizeOfPredicates, 41 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 29/109 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-47-50-972.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-47-50-972.csv Received shutdown request...