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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:42:10,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:42:10,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:42:10,569 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:42:10,570 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:42:10,571 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:42:10,572 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:42:10,573 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:42:10,574 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:42:10,575 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:42:10,576 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:42:10,576 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:42:10,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:42:10,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:42:10,578 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:42:10,580 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:42:10,582 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:42:10,583 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:42:10,584 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:42:10,585 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:42:10,586 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:42:10,587 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:42:10,587 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:42:10,588 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:42:10,588 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:42:10,589 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:42:10,589 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:42:10,590 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:42:10,590 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:42:10,590 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:42:10,591 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:42:10,591 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:42:10,600 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:42:10,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:42:10,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:42:10,602 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:42:10,602 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:42:10,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:42:10,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:42:10,602 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:42:10,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:42:10,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:42:10,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:42:10,603 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:42:10,603 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:42:10,603 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:42:10,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:42:10,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:42:10,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:42:10,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:42:10,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:42:10,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:42:10,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:42:10,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:42:10,604 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:42:10,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:42:10,605 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:42:10,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:42:10,656 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:42:10,659 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:42:10,660 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:42:10,660 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:42:10,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:42:10,960 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:42:10,962 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:42:10,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:42:10,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:42:10,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:42:10,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:42:10" (1/1) ... [2018-02-02 08:42:10,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246d1816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:10, skipping insertion in model container [2018-02-02 08:42:10,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:42:10" (1/1) ... [2018-02-02 08:42:10,985 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:42:11,013 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:42:11,093 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:42:11,106 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:42:11,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11 WrapperNode [2018-02-02 08:42:11,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:42:11,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:42:11,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:42:11,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:42:11,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11" (1/1) ... [2018-02-02 08:42:11,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11" (1/1) ... [2018-02-02 08:42:11,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11" (1/1) ... [2018-02-02 08:42:11,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11" (1/1) ... [2018-02-02 08:42:11,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11" (1/1) ... [2018-02-02 08:42:11,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11" (1/1) ... [2018-02-02 08:42:11,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11" (1/1) ... [2018-02-02 08:42:11,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:42:11,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:42:11,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:42:11,133 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:42:11,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11" (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-02 08:42:11,166 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:42:11,166 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:42:11,166 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-02 08:42:11,166 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:42:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:42:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:42:11,166 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:42:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:42:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:42:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:42:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-02 08:42:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:42:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:42:11,167 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:42:11,347 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:42:11,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:42:11 BoogieIcfgContainer [2018-02-02 08:42:11,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:42:11,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:42:11,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:42:11,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:42:11,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:42:10" (1/3) ... [2018-02-02 08:42:11,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454c3c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:42:11, skipping insertion in model container [2018-02-02 08:42:11,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:42:11" (2/3) ... [2018-02-02 08:42:11,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454c3c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:42:11, skipping insertion in model container [2018-02-02 08:42:11,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:42:11" (3/3) ... [2018-02-02 08:42:11,353 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:42:11,358 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:42:11,363 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-02 08:42:11,394 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:42:11,394 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:42:11,394 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:42:11,394 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:42:11,394 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:42:11,395 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:42:11,395 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:42:11,395 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:42:11,396 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:42:11,408 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-02-02 08:42:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:42:11,416 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:11,417 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:11,417 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:11,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029996, now seen corresponding path program 1 times [2018-02-02 08:42:11,423 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:11,423 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:11,466 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:11,466 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:11,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:11,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:11,620 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-02 08:42:11,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:11,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:42:11,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:42:11,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:42:11,636 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:42:11,638 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 4 states. [2018-02-02 08:42:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:11,761 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-02-02 08:42:11,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:42:11,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 08:42:11,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:11,769 INFO L225 Difference]: With dead ends: 60 [2018-02-02 08:42:11,769 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 08:42:11,770 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:42:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 08:42:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 08:42:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 08:42:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2018-02-02 08:42:11,797 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 13 [2018-02-02 08:42:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:11,797 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2018-02-02 08:42:11,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:42:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2018-02-02 08:42:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:42:11,798 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:11,798 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:11,798 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:11,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029997, now seen corresponding path program 1 times [2018-02-02 08:42:11,798 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:11,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:11,799 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:11,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:11,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:11,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:11,914 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-02 08:42:11,914 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:11,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:42:11,915 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:42:11,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:42:11,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:42:11,916 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand 6 states. [2018-02-02 08:42:11,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:11,984 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-02-02 08:42:11,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:42:11,985 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 08:42:11,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:11,986 INFO L225 Difference]: With dead ends: 56 [2018-02-02 08:42:11,986 INFO L226 Difference]: Without dead ends: 56 [2018-02-02 08:42:11,987 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-02 08:42:11,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-02 08:42:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-02-02 08:42:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-02-02 08:42:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-02-02 08:42:11,994 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 13 [2018-02-02 08:42:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:11,994 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-02-02 08:42:11,994 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:42:11,994 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-02-02 08:42:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:42:11,995 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:11,995 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:11,995 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:11,995 INFO L82 PathProgramCache]: Analyzing trace with hash -684644977, now seen corresponding path program 1 times [2018-02-02 08:42:11,995 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:11,995 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:11,996 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:11,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:11,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:12,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:12,040 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-02 08:42:12,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:12,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:42:12,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:42:12,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:42:12,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:42:12,041 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 4 states. [2018-02-02 08:42:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:12,086 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-02-02 08:42:12,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:42:12,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 08:42:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:12,087 INFO L225 Difference]: With dead ends: 55 [2018-02-02 08:42:12,087 INFO L226 Difference]: Without dead ends: 55 [2018-02-02 08:42:12,088 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-02 08:42:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-02 08:42:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-02 08:42:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 08:42:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-02-02 08:42:12,090 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 14 [2018-02-02 08:42:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:12,091 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-02-02 08:42:12,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:42:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-02-02 08:42:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:42:12,091 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:12,091 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:12,091 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:12,091 INFO L82 PathProgramCache]: Analyzing trace with hash -684644976, now seen corresponding path program 1 times [2018-02-02 08:42:12,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:12,092 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:12,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:12,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:12,100 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:12,141 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-02 08:42:12,141 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:12,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:42:12,142 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:42:12,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:42:12,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:42:12,142 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 5 states. [2018-02-02 08:42:12,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:12,164 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-02 08:42:12,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:42:12,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 08:42:12,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:12,165 INFO L225 Difference]: With dead ends: 54 [2018-02-02 08:42:12,165 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 08:42:12,166 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:42:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 08:42:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 08:42:12,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 08:42:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-02-02 08:42:12,169 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 14 [2018-02-02 08:42:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:12,169 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-02-02 08:42:12,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:42:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-02-02 08:42:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:42:12,170 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:12,170 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:12,170 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:12,170 INFO L82 PathProgramCache]: Analyzing trace with hash 518960417, now seen corresponding path program 1 times [2018-02-02 08:42:12,170 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:12,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:12,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:12,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:12,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:12,211 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-02 08:42:12,211 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:12,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:42:12,211 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:42:12,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:42:12,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:42:12,212 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 5 states. [2018-02-02 08:42:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:12,251 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-02-02 08:42:12,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:42:12,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-02-02 08:42:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:12,253 INFO L225 Difference]: With dead ends: 51 [2018-02-02 08:42:12,253 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 08:42:12,253 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-02 08:42:12,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 08:42:12,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 08:42:12,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 08:42:12,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-02 08:42:12,257 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 22 [2018-02-02 08:42:12,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:12,257 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-02 08:42:12,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:42:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-02 08:42:12,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:42:12,258 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:12,258 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:12,258 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:12,258 INFO L82 PathProgramCache]: Analyzing trace with hash 518960418, now seen corresponding path program 1 times [2018-02-02 08:42:12,258 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:12,258 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:12,259 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,259 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:12,260 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:12,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:12,346 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-02 08:42:12,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:12,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:42:12,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:42:12,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:42:12,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:42:12,347 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-02-02 08:42:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:12,453 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2018-02-02 08:42:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:42:12,453 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-02-02 08:42:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:12,456 INFO L225 Difference]: With dead ends: 74 [2018-02-02 08:42:12,456 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 08:42:12,456 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:42:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 08:42:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-02-02 08:42:12,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 08:42:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-02-02 08:42:12,460 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 22 [2018-02-02 08:42:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:12,461 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-02-02 08:42:12,461 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:42:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-02-02 08:42:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:42:12,462 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:12,462 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:12,462 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:12,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096233, now seen corresponding path program 1 times [2018-02-02 08:42:12,462 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:12,462 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:12,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:12,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:12,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:12,498 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-02 08:42:12,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:12,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:42:12,499 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:42:12,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:42:12,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:42:12,499 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 5 states. [2018-02-02 08:42:12,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:12,529 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-02-02 08:42:12,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:42:12,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-02-02 08:42:12,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:12,531 INFO L225 Difference]: With dead ends: 59 [2018-02-02 08:42:12,531 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 08:42:12,531 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-02 08:42:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 08:42:12,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-02 08:42:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 08:42:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2018-02-02 08:42:12,533 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 23 [2018-02-02 08:42:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:12,533 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2018-02-02 08:42:12,534 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:42:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2018-02-02 08:42:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:42:12,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:12,534 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:12,534 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:12,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1092096232, now seen corresponding path program 1 times [2018-02-02 08:42:12,535 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:12,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:12,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,535 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:12,535 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:12,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:12,622 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-02 08:42:12,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:12,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:42:12,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:42:12,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:42:12,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:42:12,624 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 8 states. [2018-02-02 08:42:12,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:12,723 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2018-02-02 08:42:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:42:12,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 08:42:12,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:12,724 INFO L225 Difference]: With dead ends: 68 [2018-02-02 08:42:12,725 INFO L226 Difference]: Without dead ends: 68 [2018-02-02 08:42:12,725 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:42:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-02 08:42:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-02-02 08:42:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-02-02 08:42:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-02-02 08:42:12,728 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 23 [2018-02-02 08:42:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:12,729 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-02-02 08:42:12,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:42:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-02-02 08:42:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 08:42:12,730 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:12,730 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:12,730 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:12,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2118091962, now seen corresponding path program 1 times [2018-02-02 08:42:12,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:12,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:12,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:12,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:12,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:12,812 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-02 08:42:12,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:12,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:42:12,813 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:42:12,813 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:42:12,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:42:12,814 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 6 states. [2018-02-02 08:42:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:12,925 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-02-02 08:42:12,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:42:12,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 08:42:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:12,926 INFO L225 Difference]: With dead ends: 60 [2018-02-02 08:42:12,926 INFO L226 Difference]: Without dead ends: 46 [2018-02-02 08:42:12,927 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-02 08:42:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-02 08:42:12,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-02 08:42:12,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-02 08:42:12,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-02-02 08:42:12,930 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 26 [2018-02-02 08:42:12,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:12,930 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-02-02 08:42:12,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:42:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-02-02 08:42:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:42:12,931 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:12,931 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-02 08:42:12,931 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:12,932 INFO L82 PathProgramCache]: Analyzing trace with hash 487859445, now seen corresponding path program 1 times [2018-02-02 08:42:12,932 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:12,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:12,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:12,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:12,944 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:12,964 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-02 08:42:12,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:12,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:42:12,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:42:12,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:42:12,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:42:12,965 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 3 states. [2018-02-02 08:42:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:12,969 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-02-02 08:42:12,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:42:12,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-02-02 08:42:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:12,970 INFO L225 Difference]: With dead ends: 48 [2018-02-02 08:42:12,970 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 08:42:12,970 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:42:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 08:42:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 08:42:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 08:42:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-02-02 08:42:12,973 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 28 [2018-02-02 08:42:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:12,973 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-02-02 08:42:12,974 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:42:12,974 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-02-02 08:42:12,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-02 08:42:12,974 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:12,974 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:12,974 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:12,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1854244690, now seen corresponding path program 1 times [2018-02-02 08:42:12,975 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:12,975 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:12,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:12,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:12,985 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:12,999 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:12,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:42:12,999 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:42:12,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:42:12,999 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:42:12,999 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 3 states. [2018-02-02 08:42:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:13,005 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-02-02 08:42:13,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:42:13,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-02-02 08:42:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:13,006 INFO L225 Difference]: With dead ends: 48 [2018-02-02 08:42:13,006 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 08:42:13,006 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:42:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 08:42:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 08:42:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 08:42:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2018-02-02 08:42:13,009 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 31 [2018-02-02 08:42:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:13,010 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2018-02-02 08:42:13,010 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:42:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2018-02-02 08:42:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:42:13,010 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:13,011 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:13,011 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:13,011 INFO L82 PathProgramCache]: Analyzing trace with hash 2022484201, now seen corresponding path program 1 times [2018-02-02 08:42:13,011 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:13,011 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:13,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:13,012 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:13,012 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:13,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:13,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:13,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:42:13,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 08:42:13,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:42:13,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:42:13,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:42:13,191 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand 12 states. [2018-02-02 08:42:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:13,395 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2018-02-02 08:42:13,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:42:13,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-02-02 08:42:13,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:13,396 INFO L225 Difference]: With dead ends: 69 [2018-02-02 08:42:13,396 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 08:42:13,396 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-02-02 08:42:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 08:42:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 08:42:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 08:42:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-02-02 08:42:13,398 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 33 [2018-02-02 08:42:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:13,399 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-02-02 08:42:13,399 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:42:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-02-02 08:42:13,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:42:13,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:13,400 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:13,400 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:13,400 INFO L82 PathProgramCache]: Analyzing trace with hash -349255061, now seen corresponding path program 1 times [2018-02-02 08:42:13,400 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:13,400 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:13,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:13,401 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:13,401 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:13,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:13,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:42:13,584 INFO L209 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-02 08:42:13,599 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:13,629 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:42: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 6 treesize of output 5 [2018-02-02 08:42:13,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:13,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:13,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:42:13,703 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:13,704 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:13,706 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-02 08:42:13,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:13,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:13,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 08:42:13,750 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-02 08:42:13,751 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-02 08:42:13,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:13,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:13,770 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-02 08:42:13,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 08:42:13,835 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-02 08:42:13,838 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-02 08:42:13,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:13,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:13,853 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-02 08:42:13,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 08:42:14,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-02 08:42:14,018 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-02 08:42:14,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:42:14,025 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-02 08:42:14,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:14,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:42:14,035 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-02 08:42:14,035 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-02-02 08:42:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:14,129 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:42:14,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2018-02-02 08:42:14,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 08:42:14,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 08:42:14,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-02-02 08:42:14,130 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 24 states. [2018-02-02 08:42:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:14,702 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2018-02-02 08:42:14,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:42:14,703 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-02-02 08:42:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:14,703 INFO L225 Difference]: With dead ends: 66 [2018-02-02 08:42:14,703 INFO L226 Difference]: Without dead ends: 66 [2018-02-02 08:42:14,704 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:42:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-02-02 08:42:14,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-02-02 08:42:14,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 08:42:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-02-02 08:42:14,706 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 33 [2018-02-02 08:42:14,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:14,706 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-02-02 08:42:14,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 08:42:14,707 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-02-02 08:42:14,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 08:42:14,707 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:14,707 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:14,708 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:14,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2057994991, now seen corresponding path program 1 times [2018-02-02 08:42:14,708 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:14,708 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:14,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:14,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:14,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:14,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:14,948 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:42:14,948 INFO L209 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-02 08:42:14,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:14,973 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:42:14,979 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-02 08:42:14,981 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-02 08:42:14,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:14,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:14,986 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-02 08:42:14,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-02 08:42:15,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-02-02 08:42:15,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2018-02-02 08:42:15,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:42:15,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2018-02-02 08:42:15,284 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:15,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2018-02-02 08:42:15,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 08:42:15,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 08:42:15,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:42:15,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:33 [2018-02-02 08:42:15,389 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:15,406 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:42:15,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-02-02 08:42:15,407 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-02 08:42:15,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-02 08:42:15,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=494, Unknown=0, NotChecked=0, Total=552 [2018-02-02 08:42:15,407 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 24 states. [2018-02-02 08:42:15,853 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 62 DAG size of output 49 [2018-02-02 08:42:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:16,125 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-02-02 08:42:16,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:42:16,126 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-02-02 08:42:16,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:16,126 INFO L225 Difference]: With dead ends: 64 [2018-02-02 08:42:16,126 INFO L226 Difference]: Without dead ends: 60 [2018-02-02 08:42:16,127 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2018-02-02 08:42:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-02-02 08:42:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-02-02 08:42:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 08:42:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-02-02 08:42:16,130 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 34 [2018-02-02 08:42:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:16,130 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-02-02 08:42:16,130 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-02 08:42:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-02-02 08:42:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-02-02 08:42:16,131 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:16,131 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:16,131 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:16,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1216715776, now seen corresponding path program 2 times [2018-02-02 08:42:16,131 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:16,131 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:16,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:16,132 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:42:16,132 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:16,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:16,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:16,465 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:42:16,465 INFO L209 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-02 08:42:16,474 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:42:16,485 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:42:16,491 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:42:16,493 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:42:16,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:42:16,499 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-02 08:42:16,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,506 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-02 08:42:16,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:42:16,538 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:16,539 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-02 08:42:16,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,544 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:16,545 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:42:16,545 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-02 08:42:16,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-02 08:42:16,582 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-02 08:42:16,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 13 treesize of output 12 [2018-02-02 08:42:16,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-02 08:42:16,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-02 08:42:16,619 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-02 08:42:16,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,628 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-02 08:42:16,628 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2018-02-02 08:42:16,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2018-02-02 08:42:16,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-02 08:42:16,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:16,822 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-02 08:42:16,822 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:42:16,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:42:16,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:42:16,833 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:49 [2018-02-02 08:42:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:16,928 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:42:16,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-02-02 08:42:16,929 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:42:16,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:42:16,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:42:16,929 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 26 states. [2018-02-02 08:42:18,202 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 71 DAG size of output 52 [2018-02-02 08:42:20,289 WARN L146 SmtUtils]: Spent 2055ms on a formula simplification. DAG size of input: 76 DAG size of output 56 [2018-02-02 08:42:23,722 WARN L146 SmtUtils]: Spent 3239ms on a formula simplification. DAG size of input: 67 DAG size of output 53 [2018-02-02 08:42:27,420 WARN L143 SmtUtils]: Spent 991ms on a formula simplification that was a NOOP. DAG size: 46 [2018-02-02 08:42:28,397 WARN L146 SmtUtils]: Spent 931ms on a formula simplification. DAG size of input: 54 DAG size of output 51 [2018-02-02 08:42:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:28,473 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-02-02 08:42:28,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 08:42:28,473 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-02-02 08:42:28,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:28,474 INFO L225 Difference]: With dead ends: 74 [2018-02-02 08:42:28,474 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 08:42:28,475 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=241, Invalid=1565, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 08:42:28,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 08:42:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 53. [2018-02-02 08:42:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 08:42:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-02-02 08:42:28,477 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 44 [2018-02-02 08:42:28,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:28,477 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-02-02 08:42:28,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 08:42:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-02-02 08:42:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-02-02 08:42:28,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:42:28,478 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:42:28,478 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-02 08:42:28,479 INFO L82 PathProgramCache]: Analyzing trace with hash -936516614, now seen corresponding path program 2 times [2018-02-02 08:42:28,479 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:42:28,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:42:28,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:28,479 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:42:28,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:42:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:42:28,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:42:28,895 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:28,895 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:42:28,895 INFO L209 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-02 08:42:28,899 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:42:28,907 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:42:28,913 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:42:28,914 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:42:28,916 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:42:28,918 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-02 08:42:28,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:28,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:28,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:42:28,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:42:28,955 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-02 08:42:28,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:28,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:28,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:42:28,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 08:42:29,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2018-02-02 08:42:29,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 25 [2018-02-02 08:42:29,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:42:29,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-02-02 08:42:29,127 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:42:29,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 17 [2018-02-02 08:42:29,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-02 08:42:29,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 08:42:29,156 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-02 08:42:29,156 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:34 [2018-02-02 08:42:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:42:29,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:42:29,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2018-02-02 08:42:29,250 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:42:29,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:42:29,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:42:29,251 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 26 states. [2018-02-02 08:42:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:42:30,021 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-02-02 08:42:30,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 08:42:30,022 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 45 [2018-02-02 08:42:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:42:30,022 INFO L225 Difference]: With dead ends: 55 [2018-02-02 08:42:30,022 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 08:42:30,022 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=266, Invalid=1626, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 08:42:30,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 08:42:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 08:42:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 08:42:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 08:42:30,023 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2018-02-02 08:42:30,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:42:30,023 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 08:42:30,023 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 08:42:30,023 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 08:42:30,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 08:42:30,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:42:30 BoogieIcfgContainer [2018-02-02 08:42:30,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:42:30,027 INFO L168 Benchmark]: Toolchain (without parser) took 19066.48 ms. Allocated memory was 403.7 MB in the beginning and 741.3 MB in the end (delta: 337.6 MB). Free memory was 360.4 MB in the beginning and 498.5 MB in the end (delta: -138.1 MB). Peak memory consumption was 199.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:42:30,028 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:42:30,028 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.50 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:42:30,029 INFO L168 Benchmark]: Boogie Preprocessor took 21.18 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:42:30,029 INFO L168 Benchmark]: RCFGBuilder took 214.40 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 324.7 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-02 08:42:30,029 INFO L168 Benchmark]: TraceAbstraction took 18678.47 ms. Allocated memory was 403.7 MB in the beginning and 741.3 MB in the end (delta: 337.6 MB). Free memory was 324.7 MB in the beginning and 498.5 MB in the end (delta: -173.8 MB). Peak memory consumption was 163.8 MB. Max. memory is 5.3 GB. [2018-02-02 08:42:30,030 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 403.7 MB. Free memory is still 365.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.50 ms. Allocated memory is still 403.7 MB. Free memory was 360.4 MB in the beginning and 349.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.18 ms. Allocated memory is still 403.7 MB. Free memory was 349.8 MB in the beginning and 347.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 214.40 ms. Allocated memory is still 403.7 MB. Free memory was 347.2 MB in the beginning and 324.7 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 18678.47 ms. Allocated memory was 403.7 MB in the beginning and 741.3 MB in the end (delta: 337.6 MB). Free memory was 324.7 MB in the beginning and 498.5 MB in the end (delta: -173.8 MB). Peak memory consumption was 163.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 61 locations, 15 error locations. SAFE Result, 18.6s OverallTime, 16 OverallIterations, 3 TraceHistogramMax, 14.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 670 SDtfs, 1113 SDslu, 2494 SDs, 0 SdLazy, 2192 SolverSat, 135 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 49 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 574 NumberOfCodeBlocks, 574 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 554 ConstructedInterpolants, 51 QuantifiedInterpolants, 243997 SizeOfPredicates, 41 NumberOfNonLiveVariables, 654 ConjunctsInSsa, 118 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 29/109 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-42-30-037.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-42-30-037.csv Received shutdown request...