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/cstrcat-alloca_true-valid-memsafety_true-termination.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.23-ccafca9-m
[2018-02-03 22:44:02,541 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-02-03 22:44:02,542 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-02-03 22:44:02,553 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-02-03 22:44:02,553 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-02-03 22:44:02,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-02-03 22:44:02,554 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-02-03 22:44:02,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-02-03 22:44:02,559 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-02-03 22:44:02,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-02-03 22:44:02,561 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-02-03 22:44:02,561 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-02-03 22:44:02,562 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-02-03 22:44:02,563 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-02-03 22:44:02,564 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-02-03 22:44:02,566 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-02-03 22:44:02,567 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-02-03 22:44:02,568 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-02-03 22:44:02,569 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-02-03 22:44:02,570 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-02-03 22:44:02,572 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-02-03 22:44:02,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-02-03 22:44:02,572 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-02-03 22:44:02,573 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-02-03 22:44:02,574 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-02-03 22:44:02,575 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-02-03 22:44:02,575 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-02-03 22:44:02,576 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring...
[2018-02-03 22:44:02,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-02-03 22:44:02,576 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-02-03 22:44:02,576 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-02-03 22:44:02,577 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:44:02,586 INFO L110 SettingsManager]: Loading preferences was successful
[2018-02-03 22:44:02,587 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-02-03 22:44:02,588 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-02-03 22:44:02,588 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-02-03 22:44:02,588 INFO L133 SettingsManager]: * Use SBE=true
[2018-02-03 22:44:02,588 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-02-03 22:44:02,588 INFO L133 SettingsManager]: * sizeof long=4
[2018-02-03 22:44:02,588 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false
[2018-02-03 22:44:02,589 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-02-03 22:44:02,589 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-02-03 22:44:02,589 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-02-03 22:44:02,589 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true
[2018-02-03 22:44:02,589 INFO L133 SettingsManager]: * Bitprecise bitfields=true
[2018-02-03 22:44:02,589 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true
[2018-02-03 22:44:02,589 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-02-03 22:44:02,590 INFO L133 SettingsManager]: * sizeof long double=12
[2018-02-03 22:44:02,590 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-02-03 22:44:02,590 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-02-03 22:44:02,590 INFO L133 SettingsManager]: * To the following directory=./dump/
[2018-02-03 22:44:02,590 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-02-03 22:44:02,590 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-02-03 22:44:02,590 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-02-03 22:44:02,591 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK
[2018-02-03 22:44:02,591 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-02-03 22:44:02,591 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL
[2018-02-03 22:44:02,619 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-02-03 22:44:02,630 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized
[2018-02-03 22:44:02,633 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected.
[2018-02-03 22:44:02,634 INFO L271 PluginConnector]: Initializing CDTParser...
[2018-02-03 22:44:02,635 INFO L276 PluginConnector]: CDTParser initialized
[2018-02-03 22:44:02,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-02-03 22:44:02,772 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-02-03 22:44:02,774 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-02-03 22:44:02,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2018-02-03 22:44:02,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2018-02-03 22:44:02,779 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized
[2018-02-03 22:44:02,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:44:02" (1/1) ...
[2018-02-03 22:44:02,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@93c6caa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02, skipping insertion in model container
[2018-02-03 22:44:02,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:44:02" (1/1) ...
[2018-02-03 22:44:02,795 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-03 22:44:02,825 INFO L153 Dispatcher]: Using SV-COMP mode
[2018-02-03 22:44:02,929 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-03 22:44:02,948 INFO L450 PostProcessor]: Settings: Checked method=main
[2018-02-03 22:44:02,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02 WrapperNode
[2018-02-03 22:44:02,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2018-02-03 22:44:02,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-02-03 22:44:02,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-02-03 22:44:02,956 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-02-03 22:44:02,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02" (1/1) ...
[2018-02-03 22:44:02,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02" (1/1) ...
[2018-02-03 22:44:02,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02" (1/1) ...
[2018-02-03 22:44:02,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02" (1/1) ...
[2018-02-03 22:44:02,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02" (1/1) ...
[2018-02-03 22:44:02,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02" (1/1) ...
[2018-02-03 22:44:02,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02" (1/1) ...
[2018-02-03 22:44:02,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-02-03 22:44:02,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-02-03 22:44:02,981 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-02-03 22:44:02,981 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-02-03 22:44:02,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02" (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:44:03,024 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2018-02-03 22:44:03,024 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-02-03 22:44:03,024 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrcat
[2018-02-03 22:44:03,024 INFO L136 BoogieDeclarations]: Found implementation of procedure main
[2018-02-03 22:44:03,025 INFO L128 BoogieDeclarations]: Found specification of procedure write~int
[2018-02-03 22:44:03,025 INFO L128 BoogieDeclarations]: Found specification of procedure read~int
[2018-02-03 22:44:03,025 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free
[2018-02-03 22:44:03,025 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2018-02-03 22:44:03,025 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc
[2018-02-03 22:44:03,025 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2018-02-03 22:44:03,025 INFO L128 BoogieDeclarations]: Found specification of procedure cstrcat
[2018-02-03 22:44:03,026 INFO L128 BoogieDeclarations]: Found specification of procedure main
[2018-02-03 22:44:03,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2018-02-03 22:44:03,026 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-02-03 22:44:03,257 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-02-03 22:44:03,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:44:03 BoogieIcfgContainer
[2018-02-03 22:44:03,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-02-03 22:44:03,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2018-02-03 22:44:03,258 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2018-02-03 22:44:03,261 INFO L276 PluginConnector]: TraceAbstraction initialized
[2018-02-03 22:44:03,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:44:02" (1/3) ...
[2018-02-03 22:44:03,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681dd032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:44:03, skipping insertion in model container
[2018-02-03 22:44:03,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:44:02" (2/3) ...
[2018-02-03 22:44:03,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@681dd032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:44:03, skipping insertion in model container
[2018-02-03 22:44:03,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:44:03" (3/3) ...
[2018-02-03 22:44:03,264 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i
[2018-02-03 22:44:03,271 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2018-02-03 22:44:03,277 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations.
[2018-02-03 22:44:03,309 INFO L322 AbstractCegarLoop]: Interprodecural is true
[2018-02-03 22:44:03,310 INFO L323 AbstractCegarLoop]: Hoare is false
[2018-02-03 22:44:03,310 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP
[2018-02-03 22:44:03,310 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK
[2018-02-03 22:44:03,310 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2018-02-03 22:44:03,310 INFO L327 AbstractCegarLoop]: Difference is false
[2018-02-03 22:44:03,310 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2018-02-03 22:44:03,310 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2018-02-03 22:44:03,311 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure
[2018-02-03 22:44:03,324 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states.
[2018-02-03 22:44:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2018-02-03 22:44:03,333 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:03,334 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:03,334 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash 104454547, now seen corresponding path program 1 times
[2018-02-03 22:44:03,340 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:03,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:03,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:03,369 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:03,369 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:03,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:03,454 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:44:03,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:03,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2018-02-03 22:44:03,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states
[2018-02-03 22:44:03,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2018-02-03 22:44:03,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-03 22:44:03,465 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 3 states.
[2018-02-03 22:44:03,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:03,531 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions.
[2018-02-03 22:44:03,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2018-02-03 22:44:03,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2018-02-03 22:44:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:03,600 INFO L225 Difference]: With dead ends: 50
[2018-02-03 22:44:03,600 INFO L226 Difference]: Without dead ends: 46
[2018-02-03 22:44:03,601 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2018-02-03 22:44:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2018-02-03 22:44:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46.
[2018-02-03 22:44:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states.
[2018-02-03 22:44:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions.
[2018-02-03 22:44:03,621 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 11
[2018-02-03 22:44:03,622 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:03,622 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions.
[2018-02-03 22:44:03,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2018-02-03 22:44:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions.
[2018-02-03 22:44:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-02-03 22:44:03,622 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:03,622 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:03,622 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:03,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224676, now seen corresponding path program 1 times
[2018-02-03 22:44:03,623 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:03,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:03,623 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:03,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:03,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:03,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:03,692 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:44:03,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:03,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-03 22:44:03,694 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-03 22:44:03,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-03 22:44:03,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-03 22:44:03,694 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states.
[2018-02-03 22:44:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:03,751 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions.
[2018-02-03 22:44:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-03 22:44:03,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15
[2018-02-03 22:44:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:03,752 INFO L225 Difference]: With dead ends: 45
[2018-02-03 22:44:03,752 INFO L226 Difference]: Without dead ends: 45
[2018-02-03 22:44:03,753 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2018-02-03 22:44:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2018-02-03 22:44:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45.
[2018-02-03 22:44:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2018-02-03 22:44:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions.
[2018-02-03 22:44:03,757 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15
[2018-02-03 22:44:03,757 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:03,757 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions.
[2018-02-03 22:44:03,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-03 22:44:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions.
[2018-02-03 22:44:03,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2018-02-03 22:44:03,758 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:03,758 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:03,758 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:03,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1017224677, now seen corresponding path program 1 times
[2018-02-03 22:44:03,758 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:03,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:03,759 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:03,759 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:03,760 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:03,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:03,868 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:44:03,868 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:03,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-03 22:44:03,869 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-03 22:44:03,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-03 22:44:03,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2018-02-03 22:44:03,869 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states.
[2018-02-03 22:44:03,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:03,928 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions.
[2018-02-03 22:44:03,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-03 22:44:03,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2018-02-03 22:44:03,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:03,929 INFO L225 Difference]: With dead ends: 44
[2018-02-03 22:44:03,929 INFO L226 Difference]: Without dead ends: 44
[2018-02-03 22:44:03,930 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:44:03,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2018-02-03 22:44:03,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44.
[2018-02-03 22:44:03,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states.
[2018-02-03 22:44:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions.
[2018-02-03 22:44:03,934 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 15
[2018-02-03 22:44:03,934 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:03,934 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions.
[2018-02-03 22:44:03,934 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-03 22:44:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions.
[2018-02-03 22:44:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-03 22:44:03,935 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:03,935 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:03,935 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193927, now seen corresponding path program 1 times
[2018-02-03 22:44:03,935 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:03,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:03,936 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:03,937 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:03,937 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:03,948 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:03,972 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:44:03,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:03,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2018-02-03 22:44:03,973 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states
[2018-02-03 22:44:03,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2018-02-03 22:44:03,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2018-02-03 22:44:03,973 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 4 states.
[2018-02-03 22:44:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:04,003 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions.
[2018-02-03 22:44:04,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2018-02-03 22:44:04,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16
[2018-02-03 22:44:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:04,004 INFO L225 Difference]: With dead ends: 43
[2018-02-03 22:44:04,004 INFO L226 Difference]: Without dead ends: 43
[2018-02-03 22:44:04,004 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:44:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states.
[2018-02-03 22:44:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43.
[2018-02-03 22:44:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2018-02-03 22:44:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions.
[2018-02-03 22:44:04,006 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16
[2018-02-03 22:44:04,006 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:04,006 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions.
[2018-02-03 22:44:04,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2018-02-03 22:44:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions.
[2018-02-03 22:44:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-03 22:44:04,007 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:04,007 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:04,007 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1469193928, now seen corresponding path program 1 times
[2018-02-03 22:44:04,007 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:04,007 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:04,008 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,008 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:04,008 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:04,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:04,060 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:44:04,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:04,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-03 22:44:04,061 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-03 22:44:04,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-03 22:44:04,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2018-02-03 22:44:04,062 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 6 states.
[2018-02-03 22:44:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:04,168 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions.
[2018-02-03 22:44:04,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2018-02-03 22:44:04,168 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2018-02-03 22:44:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:04,171 INFO L225 Difference]: With dead ends: 58
[2018-02-03 22:44:04,171 INFO L226 Difference]: Without dead ends: 58
[2018-02-03 22:44:04,171 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72
[2018-02-03 22:44:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states.
[2018-02-03 22:44:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50.
[2018-02-03 22:44:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states.
[2018-02-03 22:44:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions.
[2018-02-03 22:44:04,179 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 16
[2018-02-03 22:44:04,179 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:04,179 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions.
[2018-02-03 22:44:04,180 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-03 22:44:04,180 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions.
[2018-02-03 22:44:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2018-02-03 22:44:04,180 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:04,180 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:04,180 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash 659847302, now seen corresponding path program 1 times
[2018-02-03 22:44:04,181 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:04,181 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:04,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:04,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:04,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:04,249 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:44:04,250 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:04,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-03 22:44:04,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-03 22:44:04,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-03 22:44:04,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2018-02-03 22:44:04,251 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 7 states.
[2018-02-03 22:44:04,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:04,317 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions.
[2018-02-03 22:44:04,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-03 22:44:04,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2018-02-03 22:44:04,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:04,318 INFO L225 Difference]: With dead ends: 49
[2018-02-03 22:44:04,318 INFO L226 Difference]: Without dead ends: 49
[2018-02-03 22:44:04,318 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110
[2018-02-03 22:44:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2018-02-03 22:44:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42.
[2018-02-03 22:44:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states.
[2018-02-03 22:44:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions.
[2018-02-03 22:44:04,321 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 16
[2018-02-03 22:44:04,322 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:04,322 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions.
[2018-02-03 22:44:04,322 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-03 22:44:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions.
[2018-02-03 22:44:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-02-03 22:44:04,322 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:04,323 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]
[2018-02-03 22:44:04,323 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:04,323 INFO L82 PathProgramCache]: Analyzing trace with hash -262056781, now seen corresponding path program 1 times
[2018-02-03 22:44:04,323 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:04,323 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:04,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,324 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:04,324 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:04,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:04,355 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:44:04,355 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:04,355 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2018-02-03 22:44:04,356 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states
[2018-02-03 22:44:04,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2018-02-03 22:44:04,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2018-02-03 22:44:04,356 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states.
[2018-02-03 22:44:04,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:04,387 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions.
[2018-02-03 22:44:04,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2018-02-03 22:44:04,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20
[2018-02-03 22:44:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:04,388 INFO L225 Difference]: With dead ends: 41
[2018-02-03 22:44:04,388 INFO L226 Difference]: Without dead ends: 41
[2018-02-03 22:44:04,388 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:44:04,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2018-02-03 22:44:04,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2018-02-03 22:44:04,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2018-02-03 22:44:04,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions.
[2018-02-03 22:44:04,390 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 20
[2018-02-03 22:44:04,390 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:04,390 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions.
[2018-02-03 22:44:04,390 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2018-02-03 22:44:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions.
[2018-02-03 22:44:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2018-02-03 22:44:04,390 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:04,391 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]
[2018-02-03 22:44:04,391 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:04,391 INFO L82 PathProgramCache]: Analyzing trace with hash -262056780, now seen corresponding path program 1 times
[2018-02-03 22:44:04,391 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:04,391 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:04,391 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,391 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:04,392 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:04,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:44:04,459 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:44:04,459 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:04,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2018-02-03 22:44:04,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states
[2018-02-03 22:44:04,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2018-02-03 22:44:04,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2018-02-03 22:44:04,460 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states.
[2018-02-03 22:44:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:04,541 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions.
[2018-02-03 22:44:04,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-03 22:44:04,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20
[2018-02-03 22:44:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:04,542 INFO L225 Difference]: With dead ends: 46
[2018-02-03 22:44:04,542 INFO L226 Difference]: Without dead ends: 46
[2018-02-03 22:44:04,542 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2018-02-03 22:44:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2018-02-03 22:44:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43.
[2018-02-03 22:44:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states.
[2018-02-03 22:44:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions.
[2018-02-03 22:44:04,545 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 20
[2018-02-03 22:44:04,545 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:04,545 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions.
[2018-02-03 22:44:04,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2018-02-03 22:44:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions.
[2018-02-03 22:44:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2018-02-03 22:44:04,546 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:04,546 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:04,547 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1316966177, now seen corresponding path program 1 times
[2018-02-03 22:44:04,547 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:04,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:04,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,548 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:04,548 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:04,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:04,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:04,622 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:44:04,631 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:04,659 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:04,701 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 11 treesize of output 8
[2018-02-03 22:44:04,703 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 8 treesize of output 7
[2018-02-03 22:44:04,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:04,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:04,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:04,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7
[2018-02-03 22:44:04,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2018-02-03 22:44:04,766 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 11 treesize of output 3
[2018-02-03 22:44:04,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:04,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:04,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:04,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3
[2018-02-03 22:44:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:04,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-03 22:44:04,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13
[2018-02-03 22:44:04,808 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states
[2018-02-03 22:44:04,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2018-02-03 22:44:04,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2018-02-03 22:44:04,808 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 13 states.
[2018-02-03 22:44:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:05,055 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions.
[2018-02-03 22:44:05,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-03 22:44:05,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23
[2018-02-03 22:44:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:05,057 INFO L225 Difference]: With dead ends: 88
[2018-02-03 22:44:05,058 INFO L226 Difference]: Without dead ends: 88
[2018-02-03 22:44:05,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702
[2018-02-03 22:44:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2018-02-03 22:44:05,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 58.
[2018-02-03 22:44:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states.
[2018-02-03 22:44:05,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions.
[2018-02-03 22:44:05,062 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 23
[2018-02-03 22:44:05,062 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:05,062 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions.
[2018-02-03 22:44:05,062 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states.
[2018-02-03 22:44:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions.
[2018-02-03 22:44:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-02-03 22:44:05,063 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:05,063 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]
[2018-02-03 22:44:05,063 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:05,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2123766212, now seen corresponding path program 1 times
[2018-02-03 22:44:05,064 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:05,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:05,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,065 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:05,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:05,073 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:05,112 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:44:05,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:05,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-03 22:44:05,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-03 22:44:05,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-03 22:44:05,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-03 22:44:05,113 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand 6 states.
[2018-02-03 22:44:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:05,176 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions.
[2018-02-03 22:44:05,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-03 22:44:05,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24
[2018-02-03 22:44:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:05,178 INFO L225 Difference]: With dead ends: 57
[2018-02-03 22:44:05,178 INFO L226 Difference]: Without dead ends: 57
[2018-02-03 22:44:05,178 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-02-03 22:44:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states.
[2018-02-03 22:44:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57.
[2018-02-03 22:44:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states.
[2018-02-03 22:44:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions.
[2018-02-03 22:44:05,181 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 24
[2018-02-03 22:44:05,181 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:05,181 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions.
[2018-02-03 22:44:05,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-03 22:44:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions.
[2018-02-03 22:44:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2018-02-03 22:44:05,181 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:05,181 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]
[2018-02-03 22:44:05,181 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:05,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2123766211, now seen corresponding path program 1 times
[2018-02-03 22:44:05,182 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:05,182 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:05,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:05,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:05,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:05,253 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:44:05,253 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:05,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2018-02-03 22:44:05,254 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states
[2018-02-03 22:44:05,254 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2018-02-03 22:44:05,254 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2018-02-03 22:44:05,254 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 9 states.
[2018-02-03 22:44:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:05,312 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions.
[2018-02-03 22:44:05,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-03 22:44:05,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24
[2018-02-03 22:44:05,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:05,313 INFO L225 Difference]: With dead ends: 64
[2018-02-03 22:44:05,313 INFO L226 Difference]: Without dead ends: 64
[2018-02-03 22:44:05,313 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182
[2018-02-03 22:44:05,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-02-03 22:44:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60.
[2018-02-03 22:44:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states.
[2018-02-03 22:44:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions.
[2018-02-03 22:44:05,316 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 24
[2018-02-03 22:44:05,316 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:05,316 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions.
[2018-02-03 22:44:05,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2018-02-03 22:44:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions.
[2018-02-03 22:44:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-03 22:44:05,317 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:05,317 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]
[2018-02-03 22:44:05,317 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1412243135, now seen corresponding path program 1 times
[2018-02-03 22:44:05,317 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:05,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:05,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,317 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:05,318 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:05,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:05,352 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:44:05,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:05,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-03 22:44:05,353 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-03 22:44:05,353 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-03 22:44:05,353 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-03 22:44:05,353 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand 6 states.
[2018-02-03 22:44:05,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:05,405 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions.
[2018-02-03 22:44:05,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2018-02-03 22:44:05,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25
[2018-02-03 22:44:05,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:05,406 INFO L225 Difference]: With dead ends: 59
[2018-02-03 22:44:05,406 INFO L226 Difference]: Without dead ends: 59
[2018-02-03 22:44:05,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2018-02-03 22:44:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2018-02-03 22:44:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59.
[2018-02-03 22:44:05,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states.
[2018-02-03 22:44:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions.
[2018-02-03 22:44:05,409 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 25
[2018-02-03 22:44:05,409 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:05,409 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions.
[2018-02-03 22:44:05,409 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-03 22:44:05,409 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions.
[2018-02-03 22:44:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2018-02-03 22:44:05,410 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:05,410 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]
[2018-02-03 22:44:05,410 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:05,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1412243134, now seen corresponding path program 1 times
[2018-02-03 22:44:05,410 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:05,410 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:05,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,411 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:05,411 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:05,419 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:05,500 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:44:05,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:05,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2018-02-03 22:44:05,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states
[2018-02-03 22:44:05,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2018-02-03 22:44:05,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2018-02-03 22:44:05,501 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 8 states.
[2018-02-03 22:44:05,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:05,612 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions.
[2018-02-03 22:44:05,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2018-02-03 22:44:05,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25
[2018-02-03 22:44:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:05,613 INFO L225 Difference]: With dead ends: 64
[2018-02-03 22:44:05,614 INFO L226 Difference]: Without dead ends: 64
[2018-02-03 22:44:05,614 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156
[2018-02-03 22:44:05,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2018-02-03 22:44:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63.
[2018-02-03 22:44:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2018-02-03 22:44:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions.
[2018-02-03 22:44:05,617 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 25
[2018-02-03 22:44:05,621 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:05,621 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions.
[2018-02-03 22:44:05,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2018-02-03 22:44:05,621 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions.
[2018-02-03 22:44:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-03 22:44:05,622 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:05,622 INFO L351 BasicCegarLoop]: trace histogram [3, 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:44:05,622 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:05,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1513907666, now seen corresponding path program 1 times
[2018-02-03 22:44:05,622 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:05,622 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:05,623 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,623 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:05,623 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:05,633 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-03 22:44:05,735 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:05,735 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2018-02-03 22:44:05,735 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-03 22:44:05,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-03 22:44:05,736 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2018-02-03 22:44:05,736 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 12 states.
[2018-02-03 22:44:05,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:05,899 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions.
[2018-02-03 22:44:05,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-03 22:44:05,899 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26
[2018-02-03 22:44:05,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:05,900 INFO L225 Difference]: With dead ends: 102
[2018-02-03 22:44:05,900 INFO L226 Difference]: Without dead ends: 102
[2018-02-03 22:44:05,900 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650
[2018-02-03 22:44:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2018-02-03 22:44:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 64.
[2018-02-03 22:44:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states.
[2018-02-03 22:44:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions.
[2018-02-03 22:44:05,903 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 26
[2018-02-03 22:44:05,904 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:05,904 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions.
[2018-02-03 22:44:05,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-03 22:44:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions.
[2018-02-03 22:44:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2018-02-03 22:44:05,905 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:05,905 INFO L351 BasicCegarLoop]: trace histogram [3, 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:44:05,905 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash -175036076, now seen corresponding path program 1 times
[2018-02-03 22:44:05,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:05,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:05,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,906 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:05,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:05,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:06,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:06,042 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:06,042 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:44:06,047 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:06,061 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:06,071 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:44:06,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:06,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:06,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-02-03 22:44:06,102 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:44:06,104 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:44:06,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:06,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:06,109 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:44:06,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-02-03 22:44:06,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14
[2018-02-03 22:44:06,185 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:44:06,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:06,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:06,195 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:44:06,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35
[2018-02-03 22:44:06,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:06,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:06,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20
[2018-02-03 22:44:06,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states
[2018-02-03 22:44:06,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2018-02-03 22:44:06,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420
[2018-02-03 22:44:06,287 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 21 states.
[2018-02-03 22:44:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:06,774 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions.
[2018-02-03 22:44:06,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-03 22:44:06,775 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26
[2018-02-03 22:44:06,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:06,775 INFO L225 Difference]: With dead ends: 83
[2018-02-03 22:44:06,775 INFO L226 Difference]: Without dead ends: 83
[2018-02-03 22:44:06,776 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930
[2018-02-03 22:44:06,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2018-02-03 22:44:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75.
[2018-02-03 22:44:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states.
[2018-02-03 22:44:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions.
[2018-02-03 22:44:06,779 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 26
[2018-02-03 22:44:06,779 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:06,779 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions.
[2018-02-03 22:44:06,779 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states.
[2018-02-03 22:44:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions.
[2018-02-03 22:44:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2018-02-03 22:44:06,780 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:06,780 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:44:06,780 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash -707331403, now seen corresponding path program 1 times
[2018-02-03 22:44:06,781 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:06,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:06,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:06,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:06,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:06,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:06,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:06,854 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:44:06,859 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:06,875 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:06,878 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:44:06,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:06,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:06,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9
[2018-02-03 22:44:06,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:06,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:06,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14
[2018-02-03 22:44:06,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-03 22:44:06,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-03 22:44:06,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210
[2018-02-03 22:44:06,966 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 15 states.
[2018-02-03 22:44:07,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:07,088 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions.
[2018-02-03 22:44:07,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2018-02-03 22:44:07,088 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28
[2018-02-03 22:44:07,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:07,089 INFO L225 Difference]: With dead ends: 85
[2018-02-03 22:44:07,089 INFO L226 Difference]: Without dead ends: 85
[2018-02-03 22:44:07,089 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420
[2018-02-03 22:44:07,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2018-02-03 22:44:07,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80.
[2018-02-03 22:44:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states.
[2018-02-03 22:44:07,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions.
[2018-02-03 22:44:07,092 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 28
[2018-02-03 22:44:07,093 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:07,093 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions.
[2018-02-03 22:44:07,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-03 22:44:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions.
[2018-02-03 22:44:07,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-03 22:44:07,093 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:07,094 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, 1]
[2018-02-03 22:44:07,094 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash -653260906, now seen corresponding path program 1 times
[2018-02-03 22:44:07,094 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:07,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:07,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:07,094 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:07,094 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:07,106 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:07,244 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:44:07,244 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:07,251 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2018-02-03 22:44:07,251 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states
[2018-02-03 22:44:07,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2018-02-03 22:44:07,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210
[2018-02-03 22:44:07,252 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 15 states.
[2018-02-03 22:44:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:07,535 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions.
[2018-02-03 22:44:07,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-02-03 22:44:07,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29
[2018-02-03 22:44:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:07,536 INFO L225 Difference]: With dead ends: 161
[2018-02-03 22:44:07,536 INFO L226 Difference]: Without dead ends: 161
[2018-02-03 22:44:07,536 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122
[2018-02-03 22:44:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states.
[2018-02-03 22:44:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134.
[2018-02-03 22:44:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states.
[2018-02-03 22:44:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions.
[2018-02-03 22:44:07,539 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 29
[2018-02-03 22:44:07,540 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:07,540 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions.
[2018-02-03 22:44:07,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states.
[2018-02-03 22:44:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions.
[2018-02-03 22:44:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-03 22:44:07,541 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:07,541 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, 1]
[2018-02-03 22:44:07,541 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash -434406188, now seen corresponding path program 1 times
[2018-02-03 22:44:07,541 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:07,542 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:07,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:07,542 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:07,542 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:07,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:07,754 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:07,754 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:44:07,763 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:07,777 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:07,779 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:44:07,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:07,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:07,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9
[2018-02-03 22:44:07,811 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:07,811 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:07,813 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:44:07,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:07,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:07,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8
[2018-02-03 22:44:07,851 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:44:07,852 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:44:07,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:07,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:07,860 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:44:07,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25
[2018-02-03 22:44:07,880 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:44:07,881 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:44:07,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:07,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:07,890 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:44:07,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35
[2018-02-03 22:44:08,052 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 30 treesize of output 28
[2018-02-03 22:44:08,055 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:44:08,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:08,066 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:44:08,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:08,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:08,081 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:44:08,081 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29
[2018-02-03 22:44:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:08,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:08,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23
[2018-02-03 22:44:08,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states
[2018-02-03 22:44:08,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2018-02-03 22:44:08,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552
[2018-02-03 22:44:08,135 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand 24 states.
[2018-02-03 22:44:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:08,834 INFO L93 Difference]: Finished difference Result 143 states and 163 transitions.
[2018-02-03 22:44:08,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states.
[2018-02-03 22:44:08,834 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29
[2018-02-03 22:44:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:08,835 INFO L225 Difference]: With dead ends: 143
[2018-02-03 22:44:08,835 INFO L226 Difference]: Without dead ends: 143
[2018-02-03 22:44:08,836 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260
[2018-02-03 22:44:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states.
[2018-02-03 22:44:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139.
[2018-02-03 22:44:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states.
[2018-02-03 22:44:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions.
[2018-02-03 22:44:08,839 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 29
[2018-02-03 22:44:08,839 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:08,839 INFO L432 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions.
[2018-02-03 22:44:08,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states.
[2018-02-03 22:44:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions.
[2018-02-03 22:44:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2018-02-03 22:44:08,840 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:08,840 INFO L351 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:08,840 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:08,840 INFO L82 PathProgramCache]: Analyzing trace with hash -409487743, now seen corresponding path program 2 times
[2018-02-03 22:44:08,840 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:08,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:08,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:08,841 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:08,841 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:08,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:09,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:09,286 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:09,291 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-03 22:44:09,310 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-03 22:44:09,310 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:09,312 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:09,339 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:44:09,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:09,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:09,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-02-03 22:44:09,372 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:44:09,374 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:44:09,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:09,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:09,379 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:44:09,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-02-03 22:44:09,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19
[2018-02-03 22:44:09,485 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:09,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 25
[2018-02-03 22:44:09,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:09,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:09,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:09,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58
[2018-02-03 22:44:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:09,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:09,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29
[2018-02-03 22:44:09,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states
[2018-02-03 22:44:09,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2018-02-03 22:44:09,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870
[2018-02-03 22:44:09,582 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand 30 states.
[2018-02-03 22:44:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:10,120 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions.
[2018-02-03 22:44:10,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2018-02-03 22:44:10,120 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29
[2018-02-03 22:44:10,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:10,121 INFO L225 Difference]: With dead ends: 180
[2018-02-03 22:44:10,121 INFO L226 Difference]: Without dead ends: 180
[2018-02-03 22:44:10,121 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=1567, Unknown=0, NotChecked=0, Total=1806
[2018-02-03 22:44:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2018-02-03 22:44:10,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 149.
[2018-02-03 22:44:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states.
[2018-02-03 22:44:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 172 transitions.
[2018-02-03 22:44:10,125 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 172 transitions. Word has length 29
[2018-02-03 22:44:10,125 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:10,125 INFO L432 AbstractCegarLoop]: Abstraction has 149 states and 172 transitions.
[2018-02-03 22:44:10,125 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states.
[2018-02-03 22:44:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 172 transitions.
[2018-02-03 22:44:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2018-02-03 22:44:10,126 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:10,126 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:10,126 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1617883298, now seen corresponding path program 2 times
[2018-02-03 22:44:10,126 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:10,126 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:10,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:10,127 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:10,127 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:10,132 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:10,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:10,177 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:10,183 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-03 22:44:10,195 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2018-02-03 22:44:10,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:10,197 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2018-02-03 22:44:10,257 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2018-02-03 22:44:10,257 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11
[2018-02-03 22:44:10,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states
[2018-02-03 22:44:10,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2018-02-03 22:44:10,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2018-02-03 22:44:10,258 INFO L87 Difference]: Start difference. First operand 149 states and 172 transitions. Second operand 12 states.
[2018-02-03 22:44:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:10,405 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions.
[2018-02-03 22:44:10,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states.
[2018-02-03 22:44:10,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31
[2018-02-03 22:44:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:10,406 INFO L225 Difference]: With dead ends: 154
[2018-02-03 22:44:10,406 INFO L226 Difference]: Without dead ends: 154
[2018-02-03 22:44:10,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462
[2018-02-03 22:44:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2018-02-03 22:44:10,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 141.
[2018-02-03 22:44:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states.
[2018-02-03 22:44:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 161 transitions.
[2018-02-03 22:44:10,410 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 161 transitions. Word has length 31
[2018-02-03 22:44:10,410 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:10,410 INFO L432 AbstractCegarLoop]: Abstraction has 141 states and 161 transitions.
[2018-02-03 22:44:10,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states.
[2018-02-03 22:44:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 161 transitions.
[2018-02-03 22:44:10,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2018-02-03 22:44:10,411 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:10,411 INFO L351 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:10,411 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:10,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1342276044, now seen corresponding path program 3 times
[2018-02-03 22:44:10,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:10,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:10,412 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:10,412 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:10,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:10,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:10,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:10,755 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:10,760 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-02-03 22:44:10,776 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2018-02-03 22:44:10,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:10,778 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:10,797 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:44:10,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:10,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:10,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-02-03 22:44:10,840 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:44:10,842 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:44:10,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:10,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:10,847 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:44:10,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-02-03 22:44:11,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25
[2018-02-03 22:44:11,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 55
[2018-02-03 22:44:11,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts.
[2018-02-03 22:44:11,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:11,116 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:44:11,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:61
[2018-02-03 22:44:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:11,249 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:11,249 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 33
[2018-02-03 22:44:11,249 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states
[2018-02-03 22:44:11,249 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2018-02-03 22:44:11,250 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122
[2018-02-03 22:44:11,250 INFO L87 Difference]: Start difference. First operand 141 states and 161 transitions. Second operand 34 states.
[2018-02-03 22:44:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:12,127 INFO L93 Difference]: Finished difference Result 185 states and 210 transitions.
[2018-02-03 22:44:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states.
[2018-02-03 22:44:12,128 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 32
[2018-02-03 22:44:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:12,128 INFO L225 Difference]: With dead ends: 185
[2018-02-03 22:44:12,128 INFO L226 Difference]: Without dead ends: 185
[2018-02-03 22:44:12,129 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=264, Invalid=2186, Unknown=0, NotChecked=0, Total=2450
[2018-02-03 22:44:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states.
[2018-02-03 22:44:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 147.
[2018-02-03 22:44:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2018-02-03 22:44:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions.
[2018-02-03 22:44:12,133 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 32
[2018-02-03 22:44:12,133 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:12,134 INFO L432 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions.
[2018-02-03 22:44:12,134 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states.
[2018-02-03 22:44:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions.
[2018-02-03 22:44:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2018-02-03 22:44:12,134 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:12,134 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:12,135 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash 785498486, now seen corresponding path program 1 times
[2018-02-03 22:44:12,135 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:12,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:12,135 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:12,136 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:12,136 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:12,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:44:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:12,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:12,338 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:12,343 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:12,361 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:12,371 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:44:12,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:12,375 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:44:12,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:12,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:12,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13
[2018-02-03 22:44:12,406 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:12,407 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:12,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23
[2018-02-03 22:44:12,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:12,415 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:12,416 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:12,416 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:44:12,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:12,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:12,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13
[2018-02-03 22:44:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:12,640 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:12,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27
[2018-02-03 22:44:12,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states
[2018-02-03 22:44:12,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2018-02-03 22:44:12,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756
[2018-02-03 22:44:12,641 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand 28 states.
[2018-02-03 22:44:13,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:13,247 INFO L93 Difference]: Finished difference Result 188 states and 216 transitions.
[2018-02-03 22:44:13,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2018-02-03 22:44:13,247 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33
[2018-02-03 22:44:13,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:13,247 INFO L225 Difference]: With dead ends: 188
[2018-02-03 22:44:13,248 INFO L226 Difference]: Without dead ends: 188
[2018-02-03 22:44:13,248 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162
[2018-02-03 22:44:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states.
[2018-02-03 22:44:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 151.
[2018-02-03 22:44:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states.
[2018-02-03 22:44:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions.
[2018-02-03 22:44:13,251 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 33
[2018-02-03 22:44:13,252 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:13,252 INFO L432 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions.
[2018-02-03 22:44:13,252 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states.
[2018-02-03 22:44:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions.
[2018-02-03 22:44:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2018-02-03 22:44:13,252 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:13,252 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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]
[2018-02-03 22:44:13,252 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:13,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1281886369, now seen corresponding path program 2 times
[2018-02-03 22:44:13,253 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:13,253 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:13,253 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:13,253 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:13,254 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:13,264 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:13,566 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:13,566 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:13,571 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-03 22:44:13,602 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-03 22:44:13,602 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:13,604 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:13,608 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:44:13,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,612 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:44:13,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-02-03 22:44:13,621 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:13,622 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:13,622 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:44:13,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,628 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:44:13,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13
[2018-02-03 22:44:13,661 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:44:13,662 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:44:13,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20
[2018-02-03 22:44:13,693 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 27 treesize of output 28
[2018-02-03 22:44:13,694 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:44:13,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:13,703 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:44:13,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30
[2018-02-03 22:44:13,823 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 33 treesize of output 32
[2018-02-03 22:44:13,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25
[2018-02-03 22:44:13,830 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:13,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:13,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts.
[2018-02-03 22:44:13,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51
[2018-02-03 22:44:13,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17
[2018-02-03 22:44:13,905 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 17 treesize of output 14
[2018-02-03 22:44:13,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:13,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:13,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:13,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38
[2018-02-03 22:44:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:13,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:13,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 28
[2018-02-03 22:44:13,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states
[2018-02-03 22:44:13,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2018-02-03 22:44:13,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812
[2018-02-03 22:44:13,999 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand 29 states.
[2018-02-03 22:44:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:14,523 INFO L93 Difference]: Finished difference Result 173 states and 202 transitions.
[2018-02-03 22:44:14,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states.
[2018-02-03 22:44:14,523 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 34
[2018-02-03 22:44:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:14,524 INFO L225 Difference]: With dead ends: 173
[2018-02-03 22:44:14,524 INFO L226 Difference]: Without dead ends: 173
[2018-02-03 22:44:14,524 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=1465, Unknown=0, NotChecked=0, Total=1640
[2018-02-03 22:44:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states.
[2018-02-03 22:44:14,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161.
[2018-02-03 22:44:14,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states.
[2018-02-03 22:44:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions.
[2018-02-03 22:44:14,527 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 34
[2018-02-03 22:44:14,527 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:14,527 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions.
[2018-02-03 22:44:14,527 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states.
[2018-02-03 22:44:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions.
[2018-02-03 22:44:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-02-03 22:44:14,528 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:14,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:14,528 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:14,528 INFO L82 PathProgramCache]: Analyzing trace with hash 304009148, now seen corresponding path program 1 times
[2018-02-03 22:44:14,528 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:14,528 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:14,528 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:14,528 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:14,529 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:14,534 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:14,585 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:44:14,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2018-02-03 22:44:14,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2018-02-03 22:44:14,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states
[2018-02-03 22:44:14,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2018-02-03 22:44:14,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2018-02-03 22:44:14,585 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 6 states.
[2018-02-03 22:44:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:14,640 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions.
[2018-02-03 22:44:14,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2018-02-03 22:44:14,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35
[2018-02-03 22:44:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:14,641 INFO L225 Difference]: With dead ends: 160
[2018-02-03 22:44:14,641 INFO L226 Difference]: Without dead ends: 119
[2018-02-03 22:44:14,641 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:44:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2018-02-03 22:44:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114.
[2018-02-03 22:44:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states.
[2018-02-03 22:44:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions.
[2018-02-03 22:44:14,643 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 35
[2018-02-03 22:44:14,643 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:14,643 INFO L432 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions.
[2018-02-03 22:44:14,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2018-02-03 22:44:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions.
[2018-02-03 22:44:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2018-02-03 22:44:14,643 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:14,643 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:14,643 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1600146015, now seen corresponding path program 4 times
[2018-02-03 22:44:14,644 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:14,644 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:14,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:14,644 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2018-02-03 22:44:14,644 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:14,654 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:15,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:15,212 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:15,217 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-02-03 22:44:15,232 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-02-03 22:44:15,233 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:15,235 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:15,267 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:44:15,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:15,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:15,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-02-03 22:44:15,310 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:44:15,311 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:44:15,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:15,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:15,317 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:44:15,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-02-03 22:44:15,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38
[2018-02-03 22:44:15,609 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:15,609 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:15,610 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:15,610 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:15,611 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:15,612 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:15,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93
[2018-02-03 22:44:15,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:15,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:15,656 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:44:15,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73
[2018-02-03 22:44:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:15,766 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:15,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 37
[2018-02-03 22:44:15,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states
[2018-02-03 22:44:15,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2018-02-03 22:44:15,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406
[2018-02-03 22:44:15,767 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 38 states.
[2018-02-03 22:44:16,414 WARN L146 SmtUtils]: Spent 495ms on a formula simplification. DAG size of input: 68 DAG size of output 39
[2018-02-03 22:44:17,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:17,818 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions.
[2018-02-03 22:44:17,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states.
[2018-02-03 22:44:17,819 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 35
[2018-02-03 22:44:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:17,819 INFO L225 Difference]: With dead ends: 150
[2018-02-03 22:44:17,819 INFO L226 Difference]: Without dead ends: 150
[2018-02-03 22:44:17,820 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=386, Invalid=2806, Unknown=0, NotChecked=0, Total=3192
[2018-02-03 22:44:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2018-02-03 22:44:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126.
[2018-02-03 22:44:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states.
[2018-02-03 22:44:17,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions.
[2018-02-03 22:44:17,822 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 35
[2018-02-03 22:44:17,822 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:17,822 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions.
[2018-02-03 22:44:17,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states.
[2018-02-03 22:44:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions.
[2018-02-03 22:44:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2018-02-03 22:44:17,822 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:17,822 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 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]
[2018-02-03 22:44:17,822 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1381463977, now seen corresponding path program 2 times
[2018-02-03 22:44:17,823 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:17,823 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:17,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:17,823 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:17,823 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:17,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:18,063 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:18,063 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:18,068 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1
[2018-02-03 22:44:18,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2018-02-03 22:44:18,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:18,087 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:18,092 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:44:18,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:18,096 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:44:18,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:18,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:18,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16
[2018-02-03 22:44:18,131 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:18,132 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:18,132 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:44:18,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:18,138 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:18,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23
[2018-02-03 22:44:18,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:18,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:18,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16
[2018-02-03 22:44:18,177 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:44:18,178 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:44:18,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:18,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:18,183 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:44:18,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26
[2018-02-03 22:44:18,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14
[2018-02-03 22:44:18,247 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 15
[2018-02-03 22:44:18,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:18,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:18,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:18,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:39
[2018-02-03 22:44:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:18,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:18,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 32
[2018-02-03 22:44:18,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states
[2018-02-03 22:44:18,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2018-02-03 22:44:18,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056
[2018-02-03 22:44:18,441 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 33 states.
[2018-02-03 22:44:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:19,186 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions.
[2018-02-03 22:44:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states.
[2018-02-03 22:44:19,186 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36
[2018-02-03 22:44:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:19,186 INFO L225 Difference]: With dead ends: 165
[2018-02-03 22:44:19,186 INFO L226 Difference]: Without dead ends: 165
[2018-02-03 22:44:19,187 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=2224, Unknown=0, NotChecked=0, Total=2450
[2018-02-03 22:44:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states.
[2018-02-03 22:44:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126.
[2018-02-03 22:44:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states.
[2018-02-03 22:44:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions.
[2018-02-03 22:44:19,190 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 36
[2018-02-03 22:44:19,190 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:19,190 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions.
[2018-02-03 22:44:19,190 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states.
[2018-02-03 22:44:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions.
[2018-02-03 22:44:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-02-03 22:44:19,191 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:19,191 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:19,191 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash 269048756, now seen corresponding path program 3 times
[2018-02-03 22:44:19,191 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:19,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:19,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:19,192 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:19,192 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:19,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2018-02-03 22:44:19,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:19,449 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:19,454 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-02-03 22:44:19,493 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2018-02-03 22:44:19,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:19,496 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:19,504 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:44:19,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,509 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:44:19,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14
[2018-02-03 22:44:19,522 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:19,523 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:19,523 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:44:19,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,531 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:44:19,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13
[2018-02-03 22:44:19,546 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 15 treesize of output 12
[2018-02-03 22:44:19,547 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 12 treesize of output 11
[2018-02-03 22:44:19,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16
[2018-02-03 22:44:19,573 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 26 treesize of output 27
[2018-02-03 22:44:19,584 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:44:19,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,590 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:44:19,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26
[2018-02-03 22:44:19,696 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 33 treesize of output 32
[2018-02-03 22:44:19,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25
[2018-02-03 22:44:19,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:19,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:19,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts.
[2018-02-03 22:44:19,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:43
[2018-02-03 22:44:19,744 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 23 treesize of output 24
[2018-02-03 22:44:19,744 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 8 treesize of output 7
[2018-02-03 22:44:19,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:19,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16
[2018-02-03 22:44:19,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17
[2018-02-03 22:44:19,774 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 17 treesize of output 14
[2018-02-03 22:44:19,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:19,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:19,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:19,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32
[2018-02-03 22:44:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2018-02-03 22:44:19,827 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:19,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 25
[2018-02-03 22:44:19,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states
[2018-02-03 22:44:19,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2018-02-03 22:44:19,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650
[2018-02-03 22:44:19,828 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand 26 states.
[2018-02-03 22:44:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:20,244 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions.
[2018-02-03 22:44:20,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2018-02-03 22:44:20,244 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 39
[2018-02-03 22:44:20,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:20,245 INFO L225 Difference]: With dead ends: 125
[2018-02-03 22:44:20,245 INFO L226 Difference]: Without dead ends: 95
[2018-02-03 22:44:20,245 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=1193, Unknown=0, NotChecked=0, Total=1406
[2018-02-03 22:44:20,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2018-02-03 22:44:20,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86.
[2018-02-03 22:44:20,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states.
[2018-02-03 22:44:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions.
[2018-02-03 22:44:20,248 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 39
[2018-02-03 22:44:20,248 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:20,248 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions.
[2018-02-03 22:44:20,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states.
[2018-02-03 22:44:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions.
[2018-02-03 22:44:20,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2018-02-03 22:44:20,248 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:20,248 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 3, 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]
[2018-02-03 22:44:20,248 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:20,249 INFO L82 PathProgramCache]: Analyzing trace with hash 394604694, now seen corresponding path program 3 times
[2018-02-03 22:44:20,249 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:20,249 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:20,249 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:20,249 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:20,250 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:20,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:20,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:20,690 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:20,695 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2
[2018-02-03 22:44:20,716 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2018-02-03 22:44:20,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:20,719 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:20,724 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:44:20,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:20,730 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:44:20,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:20,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:20,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19
[2018-02-03 22:44:20,776 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:20,777 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:20,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23
[2018-02-03 22:44:20,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:20,787 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:20,787 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:20,788 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:44:20,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:20,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:20,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19
[2018-02-03 22:44:20,847 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:44:20,850 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:44:20,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:20,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:20,856 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:44:20,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29
[2018-02-03 22:44:21,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19
[2018-02-03 22:44:21,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 29
[2018-02-03 22:44:21,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts.
[2018-02-03 22:44:21,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:21,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:21,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:99
[2018-02-03 22:44:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:21,287 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:21,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37
[2018-02-03 22:44:21,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states
[2018-02-03 22:44:21,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants.
[2018-02-03 22:44:21,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1305, Unknown=0, NotChecked=0, Total=1406
[2018-02-03 22:44:21,288 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 38 states.
[2018-02-03 22:44:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:22,273 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions.
[2018-02-03 22:44:22,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states.
[2018-02-03 22:44:22,273 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 39
[2018-02-03 22:44:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:22,274 INFO L225 Difference]: With dead ends: 101
[2018-02-03 22:44:22,274 INFO L226 Difference]: Without dead ends: 101
[2018-02-03 22:44:22,274 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=265, Invalid=2597, Unknown=0, NotChecked=0, Total=2862
[2018-02-03 22:44:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2018-02-03 22:44:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96.
[2018-02-03 22:44:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2018-02-03 22:44:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions.
[2018-02-03 22:44:22,276 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 39
[2018-02-03 22:44:22,276 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:22,276 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions.
[2018-02-03 22:44:22,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states.
[2018-02-03 22:44:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions.
[2018-02-03 22:44:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2018-02-03 22:44:22,276 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:22,276 INFO L351 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2018-02-03 22:44:22,276 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:22,276 INFO L82 PathProgramCache]: Analyzing trace with hash 708041921, now seen corresponding path program 5 times
[2018-02-03 22:44:22,276 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:22,277 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:22,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:22,277 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:22,277 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:22,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:23,162 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:23,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:23,162 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:23,167 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-02-03 22:44:23,184 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s)
[2018-02-03 22:44:23,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:23,185 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:23,202 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:44:23,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:23,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:23,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-02-03 22:44:23,251 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:44:23,253 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:44:23,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:23,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:23,257 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:44:23,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-02-03 22:44:23,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54
[2018-02-03 22:44:23,802 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,803 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,804 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,804 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,805 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,805 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,806 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,806 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,807 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,807 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,808 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,809 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,809 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,810 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,810 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:23,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 187
[2018-02-03 22:44:23,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:23,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:23,947 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:44:23,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:101
[2018-02-03 22:44:24,074 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:24,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:24,091 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 45
[2018-02-03 22:44:24,091 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states
[2018-02-03 22:44:24,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2018-02-03 22:44:24,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1832, Unknown=0, NotChecked=0, Total=2070
[2018-02-03 22:44:24,091 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand 46 states.
[2018-02-03 22:44:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:28,110 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions.
[2018-02-03 22:44:28,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states.
[2018-02-03 22:44:28,111 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 41
[2018-02-03 22:44:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:28,111 INFO L225 Difference]: With dead ends: 152
[2018-02-03 22:44:28,111 INFO L226 Difference]: Without dead ends: 152
[2018-02-03 22:44:28,112 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1396 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=704, Invalid=4846, Unknown=0, NotChecked=0, Total=5550
[2018-02-03 22:44:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2018-02-03 22:44:28,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 120.
[2018-02-03 22:44:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states.
[2018-02-03 22:44:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions.
[2018-02-03 22:44:28,114 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 41
[2018-02-03 22:44:28,114 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:28,115 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions.
[2018-02-03 22:44:28,115 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states.
[2018-02-03 22:44:28,115 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions.
[2018-02-03 22:44:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2018-02-03 22:44:28,115 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:28,115 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 4, 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]
[2018-02-03 22:44:28,115 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:28,116 INFO L82 PathProgramCache]: Analyzing trace with hash -79154039, now seen corresponding path program 4 times
[2018-02-03 22:44:28,116 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:28,116 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:28,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:28,116 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:28,116 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:28,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:28,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:28,993 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:28,998 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST
[2018-02-03 22:44:29,023 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2018-02-03 22:44:29,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:29,025 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:29,030 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 19 treesize of output 18
[2018-02-03 22:44:29,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,039 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 28 treesize of output 27
[2018-02-03 22:44:29,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,048 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 27 treesize of output 26
[2018-02-03 22:44:29,048 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,049 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 18 treesize of output 17
[2018-02-03 22:44:29,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:29,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:41
[2018-02-03 22:44:29,116 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:29,116 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:29,116 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 27 treesize of output 21
[2018-02-03 22:44:29,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,129 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:29,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 30
[2018-02-03 22:44:29,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,142 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:29,143 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:29,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46
[2018-02-03 22:44:29,144 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,155 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:29,156 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:29,156 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 36 treesize of output 30
[2018-02-03 22:44:29,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:29,165 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:40
[2018-02-03 22:44:29,231 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 34 treesize of output 31
[2018-02-03 22:44:29,232 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 18 treesize of output 17
[2018-02-03 22:44:29,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,245 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 37 treesize of output 34
[2018-02-03 22:44:29,246 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:44:29,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:29,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts.
[2018-02-03 22:44:29,258 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:64
[2018-02-03 22:44:29,772 WARN L143 SmtUtils]: Spent 341ms on a formula simplification that was a NOOP. DAG size: 45
[2018-02-03 22:44:30,270 WARN L143 SmtUtils]: Spent 335ms on a formula simplification that was a NOOP. DAG size: 51
[2018-02-03 22:44:30,897 WARN L143 SmtUtils]: Spent 568ms on a formula simplification that was a NOOP. DAG size: 53
[2018-02-03 22:44:30,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60
[2018-02-03 22:44:30,912 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:30,912 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:30,913 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:30,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 58
[2018-02-03 22:44:30,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:30,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:30,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57
[2018-02-03 22:44:30,968 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:30,968 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:30,968 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:30,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 79
[2018-02-03 22:44:30,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:30,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:44:31,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts.
[2018-02-03 22:44:31,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:134, output treesize:278
[2018-02-03 22:44:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:31,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:44:31,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41
[2018-02-03 22:44:31,369 INFO L409 AbstractCegarLoop]: Interpolant automaton has 42 states
[2018-02-03 22:44:31,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants.
[2018-02-03 22:44:31,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1619, Unknown=0, NotChecked=0, Total=1722
[2018-02-03 22:44:31,370 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 42 states.
[2018-02-03 22:44:32,651 WARN L146 SmtUtils]: Spent 925ms on a formula simplification. DAG size of input: 133 DAG size of output 67
[2018-02-03 22:44:34,308 WARN L146 SmtUtils]: Spent 1610ms on a formula simplification. DAG size of input: 60 DAG size of output 49
[2018-02-03 22:44:36,129 WARN L146 SmtUtils]: Spent 1774ms on a formula simplification. DAG size of input: 108 DAG size of output 83
[2018-02-03 22:44:42,844 WARN L146 SmtUtils]: Spent 6668ms on a formula simplification. DAG size of input: 114 DAG size of output 86
[2018-02-03 22:44:43,929 WARN L146 SmtUtils]: Spent 1030ms on a formula simplification. DAG size of input: 123 DAG size of output 88
[2018-02-03 22:44:48,178 WARN L146 SmtUtils]: Spent 3994ms on a formula simplification. DAG size of input: 133 DAG size of output 94
[2018-02-03 22:44:51,914 WARN L146 SmtUtils]: Spent 3670ms on a formula simplification. DAG size of input: 118 DAG size of output 102
[2018-02-03 22:44:54,842 WARN L146 SmtUtils]: Spent 2879ms on a formula simplification. DAG size of input: 129 DAG size of output 108
[2018-02-03 22:44:55,320 WARN L146 SmtUtils]: Spent 424ms on a formula simplification. DAG size of input: 82 DAG size of output 64
[2018-02-03 22:44:56,213 WARN L146 SmtUtils]: Spent 826ms on a formula simplification. DAG size of input: 82 DAG size of output 64
[2018-02-03 22:44:56,407 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 94 DAG size of output 80
[2018-02-03 22:44:57,638 WARN L146 SmtUtils]: Spent 1174ms on a formula simplification. DAG size of input: 92 DAG size of output 78
[2018-02-03 22:44:58,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:44:58,245 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions.
[2018-02-03 22:44:58,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states.
[2018-02-03 22:44:58,296 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42
[2018-02-03 22:44:58,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:44:58,296 INFO L225 Difference]: With dead ends: 139
[2018-02-03 22:44:58,296 INFO L226 Difference]: Without dead ends: 139
[2018-02-03 22:44:58,297 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=341, Invalid=3949, Unknown=0, NotChecked=0, Total=4290
[2018-02-03 22:44:58,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2018-02-03 22:44:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125.
[2018-02-03 22:44:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states.
[2018-02-03 22:44:58,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions.
[2018-02-03 22:44:58,299 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 42
[2018-02-03 22:44:58,299 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:44:58,299 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions.
[2018-02-03 22:44:58,299 INFO L433 AbstractCegarLoop]: Interpolant automaton has 42 states.
[2018-02-03 22:44:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions.
[2018-02-03 22:44:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2018-02-03 22:44:58,300 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:44:58,300 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 5, 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]
[2018-02-03 22:44:58,300 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:44:58,300 INFO L82 PathProgramCache]: Analyzing trace with hash -563034186, now seen corresponding path program 5 times
[2018-02-03 22:44:58,300 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:44:58,300 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:44:58,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:58,301 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:44:58,301 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:44:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:44:58,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:44:58,714 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 88 DAG size of output 37
[2018-02-03 22:44:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:44:59,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:44:59,559 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:44:59,563 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1
[2018-02-03 22:44:59,580 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s)
[2018-02-03 22:44:59,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:44:59,583 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:44:59,586 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:44:59,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:59,591 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:44:59,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:59,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:59,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:25
[2018-02-03 22:44:59,647 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:59,647 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:59,648 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:44:59,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:59,654 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:44:59,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 29
[2018-02-03 22:44:59,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:59,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:59,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:25
[2018-02-03 22:44:59,714 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:44:59,715 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:44:59,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:59,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:44:59,720 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:44:59,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35
[2018-02-03 22:45:00,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31
[2018-02-03 22:45:00,033 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:45:00,034 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:45:00,034 INFO L700 Elim1Store]: detected not equals via solver
[2018-02-03 22:45:00,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53
[2018-02-03 22:45:00,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts.
[2018-02-03 22:45:00,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:45:00,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts.
[2018-02-03 22:45:00,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:151
[2018-02-03 22:45:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:45:00,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2018-02-03 22:45:00,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 43
[2018-02-03 22:45:00,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 44 states
[2018-02-03 22:45:00,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants.
[2018-02-03 22:45:00,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1782, Unknown=0, NotChecked=0, Total=1892
[2018-02-03 22:45:00,324 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 44 states.
[2018-02-03 22:45:01,601 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 115 DAG size of output 79
[2018-02-03 22:45:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2018-02-03 22:45:02,214 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions.
[2018-02-03 22:45:02,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2018-02-03 22:45:02,214 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 45
[2018-02-03 22:45:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2018-02-03 22:45:02,215 INFO L225 Difference]: With dead ends: 158
[2018-02-03 22:45:02,215 INFO L226 Difference]: Without dead ends: 158
[2018-02-03 22:45:02,216 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 867 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=282, Invalid=3750, Unknown=0, NotChecked=0, Total=4032
[2018-02-03 22:45:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2018-02-03 22:45:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 125.
[2018-02-03 22:45:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states.
[2018-02-03 22:45:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions.
[2018-02-03 22:45:02,218 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 45
[2018-02-03 22:45:02,218 INFO L84 Accepts]: Finished accepts. word is rejected.
[2018-02-03 22:45:02,218 INFO L432 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions.
[2018-02-03 22:45:02,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 44 states.
[2018-02-03 22:45:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions.
[2018-02-03 22:45:02,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2018-02-03 22:45:02,218 INFO L343 BasicCegarLoop]: Found error trace
[2018-02-03 22:45:02,218 INFO L351 BasicCegarLoop]: trace histogram [7, 7, 6, 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]
[2018-02-03 22:45:02,218 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrcatErr0RequiresViolation, cstrcatErr2RequiresViolation, cstrcatErr1RequiresViolation, cstrcatErr5RequiresViolation, cstrcatErr3RequiresViolation, cstrcatErr4RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]===
[2018-02-03 22:45:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1926248087, now seen corresponding path program 6 times
[2018-02-03 22:45:02,219 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS
[2018-02-03 22:45:02,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy
[2018-02-03 22:45:02,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:45:02,219 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2018-02-03 22:45:02,219 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order
[2018-02-03 22:45:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2018-02-03 22:45:02,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs.
[2018-02-03 22:45:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2018-02-03 22:45:03,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more.
[2018-02-03 22:45:03,167 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000
[2018-02-03 22:45:03,172 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE
[2018-02-03 22:45:03,202 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s)
[2018-02-03 22:45:03,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat
[2018-02-03 22:45:03,204 INFO L270 TraceCheckSpWp]: Computing forward predicates...
[2018-02-03 22:45:03,264 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:45:03,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2018-02-03 22:45:03,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:45:03,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14
[2018-02-03 22:45:03,321 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:45:03,322 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:45:03,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2018-02-03 22:45:03,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2018-02-03 22:45:03,327 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:45:03,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24
[2018-02-03 22:45:03,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43
[2018-02-03 22:45:03,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 43 treesize of output 181
[2018-02-03 22:45:03,958 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 16
[2018-02-03 22:45:04,370 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 65536 conjuctions. This might take some time...
Received shutdown request...
[2018-02-03 22:47:32,862 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants
[2018-02-03 22:47:32,862 WARN L491 AbstractCegarLoop]: Verification canceled
[2018-02-03 22:47:32,866 WARN L185 ceAbstractionStarter]: Timeout
[2018-02-03 22:47:32,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:47:32 BoogieIcfgContainer
[2018-02-03 22:47:32,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2018-02-03 22:47:32,866 INFO L168 Benchmark]: Toolchain (without parser) took 210093.37 ms. Allocated memory was 399.0 MB in the beginning and 710.4 MB in the end (delta: 311.4 MB). Free memory was 354.3 MB in the beginning and 483.6 MB in the end (delta: -129.2 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB.
[2018-02-03 22:47:32,867 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 399.0 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
[2018-02-03 22:47:32,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 180.51 ms. Allocated memory is still 399.0 MB. Free memory was 353.0 MB in the beginning and 342.4 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:32,867 INFO L168 Benchmark]: Boogie Preprocessor took 25.40 ms. Allocated memory is still 399.0 MB. Free memory was 342.4 MB in the beginning and 341.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
[2018-02-03 22:47:32,868 INFO L168 Benchmark]: RCFGBuilder took 276.45 ms. Allocated memory is still 399.0 MB. Free memory was 341.1 MB in the beginning and 321.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB.
[2018-02-03 22:47:32,868 INFO L168 Benchmark]: TraceAbstraction took 209607.79 ms. Allocated memory was 399.0 MB in the beginning and 710.4 MB in the end (delta: 311.4 MB). Free memory was 321.3 MB in the beginning and 483.6 MB in the end (delta: -162.3 MB). Peak memory consumption was 973.1 MB. Max. memory is 5.3 GB.
[2018-02-03 22:47:32,869 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 399.0 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB.
* CACSL2BoogieTranslator took 180.51 ms. Allocated memory is still 399.0 MB. Free memory was 353.0 MB in the beginning and 342.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB.
* Boogie Preprocessor took 25.40 ms. Allocated memory is still 399.0 MB. Free memory was 342.4 MB in the beginning and 341.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB.
* RCFGBuilder took 276.45 ms. Allocated memory is still 399.0 MB. Free memory was 341.1 MB in the beginning and 321.3 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB.
* TraceAbstraction took 209607.79 ms. Allocated memory was 399.0 MB in the beginning and 710.4 MB in the end (delta: 311.4 MB). Free memory was 321.3 MB in the beginning and 483.6 MB in the end (delta: -162.3 MB). Peak memory consumption was 973.1 MB. Max. memory is 5.3 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 543). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 566). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction)
Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction)
Unable to prove that all allocated memory was freed (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 7, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 65536 conjuctions. .
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 49 locations, 11 error locations. TIMEOUT Result, 209.5s OverallTime, 32 OverallIterations, 8 TraceHistogramMax, 42.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1031 SDtfs, 2633 SDslu, 8520 SDs, 0 SdLazy, 9705 SolverSat, 784 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1213 GetRequests, 369 SyntacticMatches, 16 SemanticMatches, 828 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7633 ImplicationChecksByTransitivity, 46.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=23, 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, 31 MinimizatonAttempts, 427 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 1401 NumberOfCodeBlocks, 1393 NumberOfCodeBlocksAsserted, 72 NumberOfCheckSat, 1354 ConstructedInterpolants, 119 QuantifiedInterpolants, 739609 SizeOfPredicates, 234 NumberOfNonLiveVariables, 2653 ConjunctsInSsa, 837 ConjunctsInUnsatCore, 47 InterpolantComputations, 17 PerfectInterpolantSequences, 29/694 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-47-32-875.csv
Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-47-32-875.csv
Completed graceful shutdown