java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 22:53:56,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 22:53:56,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 22:53:56,421 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 22:53:56,421 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 22:53:56,422 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 22:53:56,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 22:53:56,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 22:53:56,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 22:53:56,426 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 22:53:56,427 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 22:53:56,427 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 22:53:56,428 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 22:53:56,429 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 22:53:56,429 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 22:53:56,431 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 22:53:56,433 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 22:53:56,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 22:53:56,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 22:53:56,436 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 22:53:56,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 22:53:56,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 22:53:56,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 22:53:56,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 22:53:56,440 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 22:53:56,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 22:53:56,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 22:53:56,442 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 22:53:56,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 22:53:56,442 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 22:53:56,443 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 22:53:56,443 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 22:53:56,452 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 22:53:56,452 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 22:53:56,453 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 22:53:56,454 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 22:53:56,454 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 22:53:56,454 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 22:53:56,454 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 22:53:56,454 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 22:53:56,454 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 22:53:56,455 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 22:53:56,455 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 22:53:56,455 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 22:53:56,455 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 22:53:56,455 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 22:53:56,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 22:53:56,455 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 22:53:56,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 22:53:56,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 22:53:56,456 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 22:53:56,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 22:53:56,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:53:56,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 22:53:56,456 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 22:53:56,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 22:53:56,457 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 22:53:56,486 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 22:53:56,496 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 22:53:56,500 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 22:53:56,501 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 22:53:56,501 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 22:53:56,502 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:53:56,651 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 22:53:56,652 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 22:53:56,653 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 22:53:56,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 22:53:56,658 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 22:53:56,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:53:56" (1/1) ... [2018-02-03 22:53:56,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db90158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56, skipping insertion in model container [2018-02-03 22:53:56,662 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 10:53:56" (1/1) ... [2018-02-03 22:53:56,676 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:53:56,704 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 22:53:56,793 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:53:56,805 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 22:53:56,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56 WrapperNode [2018-02-03 22:53:56,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 22:53:56,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 22:53:56,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 22:53:56,810 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 22:53:56,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56" (1/1) ... [2018-02-03 22:53:56,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56" (1/1) ... [2018-02-03 22:53:56,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56" (1/1) ... [2018-02-03 22:53:56,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56" (1/1) ... [2018-02-03 22:53:56,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56" (1/1) ... [2018-02-03 22:53:56,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56" (1/1) ... [2018-02-03 22:53:56,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56" (1/1) ... [2018-02-03 22:53:56,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 22:53:56,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 22:53:56,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 22:53:56,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 22:53:56,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 22:53:56,864 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 22:53:56,865 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 22:53:56,865 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncmp [2018-02-03 22:53:56,865 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 22:53:56,865 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-03 22:53:56,865 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-03 22:53:56,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 22:53:56,865 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 22:53:56,866 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 22:53:56,866 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 22:53:56,866 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncmp [2018-02-03 22:53:56,866 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 22:53:56,866 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 22:53:56,866 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 22:53:57,063 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 22:53:57,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:53:57 BoogieIcfgContainer [2018-02-03 22:53:57,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 22:53:57,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 22:53:57,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 22:53:57,067 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 22:53:57,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 10:53:56" (1/3) ... [2018-02-03 22:53:57,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2215c27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:53:57, skipping insertion in model container [2018-02-03 22:53:57,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 10:53:56" (2/3) ... [2018-02-03 22:53:57,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2215c27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 10:53:57, skipping insertion in model container [2018-02-03 22:53:57,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 10:53:57" (3/3) ... [2018-02-03 22:53:57,070 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i [2018-02-03 22:53:57,075 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 22:53:57,080 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 15 error locations. [2018-02-03 22:53:57,110 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 22:53:57,110 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 22:53:57,110 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 22:53:57,110 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 22:53:57,110 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 22:53:57,111 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 22:53:57,111 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 22:53:57,111 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 22:53:57,112 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 22:53:57,123 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-02-03 22:53:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:53:57,132 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:57,132 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:57,133 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash -417514722, now seen corresponding path program 1 times [2018-02-03 22:53:57,138 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:57,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:57,181 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:57,182 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:57,235 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:57,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:57,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:53:57,347 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:53:57,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:53:57,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:53:57,357 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 4 states. [2018-02-03 22:53:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:57,478 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-02-03 22:53:57,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:53:57,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-03 22:53:57,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:57,488 INFO L225 Difference]: With dead ends: 57 [2018-02-03 22:53:57,489 INFO L226 Difference]: Without dead ends: 54 [2018-02-03 22:53:57,490 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:53:57,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-03 22:53:57,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-03 22:53:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:53:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-03 22:53:57,518 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 13 [2018-02-03 22:53:57,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:57,518 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-03 22:53:57,518 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:53:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-03 22:53:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-03 22:53:57,519 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:57,519 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:57,519 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:57,519 INFO L82 PathProgramCache]: Analyzing trace with hash -417514721, now seen corresponding path program 1 times [2018-02-03 22:53:57,519 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:57,519 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:57,520 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,520 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:57,521 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:57,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:57,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:57,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:57,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:53:57,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:53:57,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:53:57,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:53:57,605 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 6 states. [2018-02-03 22:53:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:57,643 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-02-03 22:53:57,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:53:57,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-03 22:53:57,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:57,644 INFO L225 Difference]: With dead ends: 53 [2018-02-03 22:53:57,644 INFO L226 Difference]: Without dead ends: 53 [2018-02-03 22:53:57,645 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-03 22:53:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-03 22:53:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-03 22:53:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:53:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-02-03 22:53:57,648 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 13 [2018-02-03 22:53:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:57,649 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-02-03 22:53:57,649 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:53:57,649 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-02-03 22:53:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:53:57,649 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:57,649 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:57,650 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:57,650 INFO L82 PathProgramCache]: Analyzing trace with hash -58054499, now seen corresponding path program 1 times [2018-02-03 22:53:57,650 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:57,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:57,651 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,651 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:57,651 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:57,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:57,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:57,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:57,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 22:53:57,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 22:53:57,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 22:53:57,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 22:53:57,688 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 4 states. [2018-02-03 22:53:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:57,738 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2018-02-03 22:53:57,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 22:53:57,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-03 22:53:57,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:57,739 INFO L225 Difference]: With dead ends: 52 [2018-02-03 22:53:57,739 INFO L226 Difference]: Without dead ends: 52 [2018-02-03 22:53:57,740 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:53:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-03 22:53:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-03 22:53:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-03 22:53:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-02-03 22:53:57,744 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 14 [2018-02-03 22:53:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:57,744 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-02-03 22:53:57,744 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 22:53:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-02-03 22:53:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-03 22:53:57,745 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:57,745 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:57,745 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:57,745 INFO L82 PathProgramCache]: Analyzing trace with hash -58054498, now seen corresponding path program 1 times [2018-02-03 22:53:57,746 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:57,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:57,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,747 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:57,747 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:57,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:57,809 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:57,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:53:57,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:53:57,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:53:57,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:53:57,811 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 5 states. [2018-02-03 22:53:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:57,843 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-02-03 22:53:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:53:57,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-03 22:53:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:57,844 INFO L225 Difference]: With dead ends: 51 [2018-02-03 22:53:57,844 INFO L226 Difference]: Without dead ends: 51 [2018-02-03 22:53:57,845 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:53:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-03 22:53:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-03 22:53:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-03 22:53:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-02-03 22:53:57,849 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 14 [2018-02-03 22:53:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:57,849 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-02-03 22:53:57,849 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:53:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-02-03 22:53:57,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:53:57,850 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:57,850 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:57,850 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:57,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356832, now seen corresponding path program 1 times [2018-02-03 22:53:57,850 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:57,850 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:57,851 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,851 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:57,851 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:57,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:57,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:57,927 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:57,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:53:57,927 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:53:57,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:53:57,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:53:57,928 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 8 states. [2018-02-03 22:53:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:58,034 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-02-03 22:53:58,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:53:58,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-03 22:53:58,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:58,037 INFO L225 Difference]: With dead ends: 68 [2018-02-03 22:53:58,037 INFO L226 Difference]: Without dead ends: 68 [2018-02-03 22:53:58,037 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:53:58,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-02-03 22:53:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2018-02-03 22:53:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-03 22:53:58,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2018-02-03 22:53:58,043 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 20 [2018-02-03 22:53:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:58,044 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2018-02-03 22:53:58,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:53:58,044 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-02-03 22:53:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-03 22:53:58,044 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:58,044 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:58,045 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1465356831, now seen corresponding path program 1 times [2018-02-03 22:53:58,045 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:58,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:58,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,046 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:58,046 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:58,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:58,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:58,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-03 22:53:58,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-03 22:53:58,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-03 22:53:58,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-03 22:53:58,093 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand 5 states. [2018-02-03 22:53:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:58,144 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-02-03 22:53:58,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-03 22:53:58,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-03 22:53:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:58,145 INFO L225 Difference]: With dead ends: 55 [2018-02-03 22:53:58,146 INFO L226 Difference]: Without dead ends: 55 [2018-02-03 22:53:58,146 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:53:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-03 22:53:58,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-03 22:53:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-03 22:53:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-02-03 22:53:58,149 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 20 [2018-02-03 22:53:58,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:58,149 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-02-03 22:53:58,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-03 22:53:58,149 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-02-03 22:53:58,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:53:58,150 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:58,150 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:58,150 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:58,150 INFO L82 PathProgramCache]: Analyzing trace with hash -541357888, now seen corresponding path program 1 times [2018-02-03 22:53:58,150 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:58,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:58,151 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,151 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:58,151 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:58,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:58,189 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:58,189 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:53:58,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:53:58,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:53:58,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:53:58,190 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 6 states. [2018-02-03 22:53:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:58,262 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-03 22:53:58,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:53:58,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-03 22:53:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:58,263 INFO L225 Difference]: With dead ends: 54 [2018-02-03 22:53:58,263 INFO L226 Difference]: Without dead ends: 54 [2018-02-03 22:53:58,263 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:53:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-03 22:53:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-03 22:53:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:53:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-02-03 22:53:58,265 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 22 [2018-02-03 22:53:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:58,265 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-02-03 22:53:58,265 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:53:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-02-03 22:53:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-03 22:53:58,265 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:58,265 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:58,266 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash -541357887, now seen corresponding path program 1 times [2018-02-03 22:53:58,266 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:58,266 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:58,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,267 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:58,267 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:58,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:58,362 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:58,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:53:58,363 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:53:58,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:53:58,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:53:58,363 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 9 states. [2018-02-03 22:53:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:58,451 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-02-03 22:53:58,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:53:58,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-03 22:53:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:58,452 INFO L225 Difference]: With dead ends: 56 [2018-02-03 22:53:58,452 INFO L226 Difference]: Without dead ends: 56 [2018-02-03 22:53:58,452 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:53:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-02-03 22:53:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-02-03 22:53:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:53:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-02-03 22:53:58,456 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 22 [2018-02-03 22:53:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:58,456 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-02-03 22:53:58,456 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:53:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-02-03 22:53:58,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:53:58,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:58,457 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:58,457 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:58,457 INFO L82 PathProgramCache]: Analyzing trace with hash -553886463, now seen corresponding path program 1 times [2018-02-03 22:53:58,457 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:58,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:58,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:58,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:58,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:58,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-03 22:53:58,498 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:58,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:53:58,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:53:58,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:53:58,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:53:58,499 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-02-03 22:53:58,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:58,543 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-03 22:53:58,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:53:58,543 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-03 22:53:58,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:58,543 INFO L225 Difference]: With dead ends: 53 [2018-02-03 22:53:58,543 INFO L226 Difference]: Without dead ends: 53 [2018-02-03 22:53:58,544 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:53:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-03 22:53:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-03 22:53:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-03 22:53:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-02-03 22:53:58,545 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 24 [2018-02-03 22:53:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:58,546 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-02-03 22:53:58,546 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:53:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-02-03 22:53:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-03 22:53:58,546 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:58,546 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:58,546 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:58,546 INFO L82 PathProgramCache]: Analyzing trace with hash -553886462, now seen corresponding path program 1 times [2018-02-03 22:53:58,546 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:58,547 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:58,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,547 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:58,547 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:58,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:58,612 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:58,612 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-03 22:53:58,612 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 22:53:58,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 22:53:58,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:53:58,613 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 8 states. [2018-02-03 22:53:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:58,690 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-02-03 22:53:58,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 22:53:58,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-02-03 22:53:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:58,692 INFO L225 Difference]: With dead ends: 64 [2018-02-03 22:53:58,692 INFO L226 Difference]: Without dead ends: 64 [2018-02-03 22:53:58,692 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:53:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-03 22:53:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2018-02-03 22:53:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-03 22:53:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-02-03 22:53:58,695 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 24 [2018-02-03 22:53:58,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:58,696 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-02-03 22:53:58,696 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 22:53:58,696 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-02-03 22:53:58,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:53:58,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:58,697 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:58,697 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1181606150, now seen corresponding path program 1 times [2018-02-03 22:53:58,697 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:58,697 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:58,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,698 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:58,698 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:58,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:58,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:58,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:58,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:53:58,766 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:53:58,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:53:58,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:53:58,767 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 6 states. [2018-02-03 22:53:58,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:58,866 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-02-03 22:53:58,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 22:53:58,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-03 22:53:58,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:58,867 INFO L225 Difference]: With dead ends: 53 [2018-02-03 22:53:58,868 INFO L226 Difference]: Without dead ends: 43 [2018-02-03 22:53:58,868 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:53:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-03 22:53:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-02-03 22:53:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-02-03 22:53:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-02-03 22:53:58,870 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 26 [2018-02-03 22:53:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:58,871 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-02-03 22:53:58,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:53:58,871 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-02-03 22:53:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:53:58,872 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:58,872 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:58,872 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:58,872 INFO L82 PathProgramCache]: Analyzing trace with hash 290777922, now seen corresponding path program 1 times [2018-02-03 22:53:58,872 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:58,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:58,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,873 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:58,873 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:58,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:58,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:58,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-03 22:53:58,912 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-03 22:53:58,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-03 22:53:58,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-03 22:53:58,913 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-02-03 22:53:58,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:58,960 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-02-03 22:53:58,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-03 22:53:58,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-03 22:53:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:58,961 INFO L225 Difference]: With dead ends: 42 [2018-02-03 22:53:58,961 INFO L226 Difference]: Without dead ends: 42 [2018-02-03 22:53:58,962 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-03 22:53:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-03 22:53:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-03 22:53:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-03 22:53:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-03 22:53:58,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 26 [2018-02-03 22:53:58,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:58,964 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-03 22:53:58,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-03 22:53:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-03 22:53:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-03 22:53:58,965 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:58,965 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:58,965 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:58,965 INFO L82 PathProgramCache]: Analyzing trace with hash 290777923, now seen corresponding path program 1 times [2018-02-03 22:53:58,965 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:58,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:58,966 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,966 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:58,966 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:58,974 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:59,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:59,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 22:53:59,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 22:53:59,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 22:53:59,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-03 22:53:59,038 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 9 states. [2018-02-03 22:53:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:59,159 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-02-03 22:53:59,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:53:59,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-02-03 22:53:59,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:59,160 INFO L225 Difference]: With dead ends: 51 [2018-02-03 22:53:59,160 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:53:59,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-02-03 22:53:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:53:59,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2018-02-03 22:53:59,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-03 22:53:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-02-03 22:53:59,162 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 26 [2018-02-03 22:53:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:59,162 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-02-03 22:53:59,163 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 22:53:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-02-03 22:53:59,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:53:59,163 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:59,163 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:59,163 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash -716230416, now seen corresponding path program 1 times [2018-02-03 22:53:59,164 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:59,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:59,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:59,165 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:59,165 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:59,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:59,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:59,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 22:53:59,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-03 22:53:59,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 22:53:59,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 22:53:59,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-03 22:53:59,300 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-02-03 22:53:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:53:59,428 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-02-03 22:53:59,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:53:59,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-02-03 22:53:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:53:59,428 INFO L225 Difference]: With dead ends: 59 [2018-02-03 22:53:59,428 INFO L226 Difference]: Without dead ends: 41 [2018-02-03 22:53:59,429 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-02-03 22:53:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-03 22:53:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-02-03 22:53:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-03 22:53:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-02-03 22:53:59,430 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 29 [2018-02-03 22:53:59,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:53:59,431 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-02-03 22:53:59,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 22:53:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-02-03 22:53:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-03 22:53:59,431 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:53:59,431 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:53:59,431 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:53:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1773298546, now seen corresponding path program 1 times [2018-02-03 22:53:59,432 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:53:59,432 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:53:59,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:59,433 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:59,433 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:53:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:59,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:53:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:53:59,622 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:53:59,622 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:53:59,630 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:53:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:53:59,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:53:59,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:53:59,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:59,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:59,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:53:59,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:59,772 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:53:59,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:53:59,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:59,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:59,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-03 22:53:59,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:53:59,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:53:59,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:59,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:59,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:59,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-03 22:53:59,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-03 22:53:59,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:53:59,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:53:59,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:53:59,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-03 22:53:59,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-03 22:54:00,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-02-03 22:54:00,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:54:00,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:00,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-02-03 22:54:00,033 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:00,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:00,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:00,044 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-02-03 22:54:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:00,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:00,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2018-02-03 22:54:00,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-03 22:54:00,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-03 22:54:00,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-02-03 22:54:00,106 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 23 states. [2018-02-03 22:54:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:00,582 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-02-03 22:54:00,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 22:54:00,583 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 29 [2018-02-03 22:54:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:00,583 INFO L225 Difference]: With dead ends: 54 [2018-02-03 22:54:00,583 INFO L226 Difference]: Without dead ends: 54 [2018-02-03 22:54:00,584 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2018-02-03 22:54:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-03 22:54:00,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-02-03 22:54:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:54:00,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-03 22:54:00,586 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 29 [2018-02-03 22:54:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:00,586 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-03 22:54:00,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-03 22:54:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-03 22:54:00,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-02-03 22:54:00,587 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:00,587 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:00,587 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:54:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash -962114157, now seen corresponding path program 1 times [2018-02-03 22:54:00,587 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:00,587 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:00,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:00,588 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:00,588 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:00,602 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:00,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:00,758 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:54:00,764 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:00,793 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:00,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-03 22:54:00,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-03 22:54:00,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:00,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:00,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:00,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-03 22:54:01,073 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 31 treesize of output 31 [2018-02-03 22:54:01,076 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 27 treesize of output 20 [2018-02-03 22:54:01,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:01,088 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 20 treesize of output 18 [2018-02-03 22:54:01,088 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:01,113 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 23 treesize of output 25 [2018-02-03 22:54:01,113 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:01,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:54:01,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:01,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-02-03 22:54:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:01,265 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:01,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2018-02-03 22:54:01,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-03 22:54:01,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-03 22:54:01,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-02-03 22:54:01,266 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 23 states. [2018-02-03 22:54:02,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:02,520 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-02-03 22:54:02,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-03 22:54:02,520 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 31 [2018-02-03 22:54:02,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:02,521 INFO L225 Difference]: With dead ends: 50 [2018-02-03 22:54:02,521 INFO L226 Difference]: Without dead ends: 50 [2018-02-03 22:54:02,522 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2018-02-03 22:54:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-03 22:54:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-03 22:54:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-03 22:54:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-02-03 22:54:02,524 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 31 [2018-02-03 22:54:02,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:02,524 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-02-03 22:54:02,524 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-03 22:54:02,525 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-02-03 22:54:02,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-03 22:54:02,525 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:02,525 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:02,525 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:54:02,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1173736108, now seen corresponding path program 1 times [2018-02-03 22:54:02,526 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:02,526 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:02,526 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:02,526 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:02,526 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:02,536 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:02,600 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:02,600 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:54:02,607 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:02,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:02,668 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:02,668 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 10 [2018-02-03 22:54:02,668 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 22:54:02,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 22:54:02,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-03 22:54:02,669 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 11 states. [2018-02-03 22:54:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:02,893 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-02-03 22:54:02,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 22:54:02,893 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-02-03 22:54:02,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:02,893 INFO L225 Difference]: With dead ends: 48 [2018-02-03 22:54:02,893 INFO L226 Difference]: Without dead ends: 48 [2018-02-03 22:54:02,894 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-02-03 22:54:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-03 22:54:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-02-03 22:54:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-03 22:54:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-02-03 22:54:02,896 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 33 [2018-02-03 22:54:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:02,896 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-02-03 22:54:02,896 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 22:54:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-02-03 22:54:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-03 22:54:02,897 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:02,897 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, 1] [2018-02-03 22:54:02,897 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:54:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1615722261, now seen corresponding path program 1 times [2018-02-03 22:54:02,897 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:02,897 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:02,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:02,898 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:02,898 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:02,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:02,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:02,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:02,997 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:54:03,002 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:03,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:03,100 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-03 22:54:03,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2018-02-03 22:54:03,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 22:54:03,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 22:54:03,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-02-03 22:54:03,101 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 13 states. [2018-02-03 22:54:03,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:03,210 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-02-03 22:54:03,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 22:54:03,210 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-02-03 22:54:03,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:03,211 INFO L225 Difference]: With dead ends: 45 [2018-02-03 22:54:03,211 INFO L226 Difference]: Without dead ends: 42 [2018-02-03 22:54:03,211 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-02-03 22:54:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-03 22:54:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-02-03 22:54:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-03 22:54:03,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-02-03 22:54:03,213 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 35 [2018-02-03 22:54:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:03,213 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-02-03 22:54:03,213 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 22:54:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-02-03 22:54:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-03 22:54:03,214 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:03,214 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:03,214 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:54:03,214 INFO L82 PathProgramCache]: Analyzing trace with hash -48907298, now seen corresponding path program 2 times [2018-02-03 22:54:03,215 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:03,215 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:03,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:03,215 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 22:54:03,215 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:03,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:03,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:03,517 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:54:03,522 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:54:03,538 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:54:03,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:03,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:03,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:54:03,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:54:03,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-03 22:54:03,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:03,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-03 22:54:03,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,583 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:03,584 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 22:54:03,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 22:54:03,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2018-02-03 22:54:03,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:54:03,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:54:03,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:03,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-02-03 22:54:03,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-02-03 22:54:03,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:54:03,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:03,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:35 [2018-02-03 22:54:03,967 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 34 treesize of output 32 [2018-02-03 22:54:03,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-02-03 22:54:03,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:03,976 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 15 [2018-02-03 22:54:03,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:03,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:03,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:03,986 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:37 [2018-02-03 22:54:04,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:04,080 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:04,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 28 [2018-02-03 22:54:04,081 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-02-03 22:54:04,081 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-02-03 22:54:04,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=739, Unknown=0, NotChecked=0, Total=812 [2018-02-03 22:54:04,081 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 29 states. [2018-02-03 22:54:07,857 WARN L146 SmtUtils]: Spent 2027ms on a formula simplification. DAG size of input: 54 DAG size of output 43 [2018-02-03 22:54:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:07,896 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-02-03 22:54:07,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-03 22:54:07,896 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2018-02-03 22:54:07,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:07,896 INFO L225 Difference]: With dead ends: 42 [2018-02-03 22:54:07,896 INFO L226 Difference]: Without dead ends: 42 [2018-02-03 22:54:07,897 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=209, Invalid=1512, Unknown=1, NotChecked=0, Total=1722 [2018-02-03 22:54:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-03 22:54:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-02-03 22:54:07,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-03 22:54:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-02-03 22:54:07,898 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-02-03 22:54:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:07,898 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-02-03 22:54:07,898 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-02-03 22:54:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-02-03 22:54:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-03 22:54:07,899 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 22:54:07,899 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 22:54:07,899 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, cstrncmpErr1RequiresViolation, cstrncmpErr5RequiresViolation, cstrncmpErr6RequiresViolation, cstrncmpErr0RequiresViolation, cstrncmpErr4RequiresViolation, cstrncmpErr7RequiresViolation, cstrncmpErr2RequiresViolation, cstrncmpErr3RequiresViolation, cstrncmpErr8RequiresViolation, cstrncmpErr9RequiresViolation]=== [2018-02-03 22:54:07,899 INFO L82 PathProgramCache]: Analyzing trace with hash 244726527, now seen corresponding path program 2 times [2018-02-03 22:54:07,899 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 22:54:07,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 22:54:07,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:07,900 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 22:54:07,900 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 22:54:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 22:54:07,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 22:54:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:08,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-03 22:54:08,173 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-03 22:54:08,182 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 22:54:08,202 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 22:54:08,202 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 22:54:08,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 22:54:08,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 22:54:08,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:08,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:08,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-03 22:54:08,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-03 22:54:08,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-03 22:54:08,246 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:08,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 22:54:08,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 22:54:08,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-02-03 22:54:08,471 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 33 treesize of output 33 [2018-02-03 22:54:08,480 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 25 treesize of output 29 [2018-02-03 22:54:08,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:08,493 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 29 treesize of output 27 [2018-02-03 22:54:08,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-03 22:54:08,504 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 21 treesize of output 16 [2018-02-03 22:54:08,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 22:54:08,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-03 22:54:08,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-03 22:54:08,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-02-03 22:54:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 22:54:08,569 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-03 22:54:08,569 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-02-03 22:54:08,570 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-03 22:54:08,570 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-03 22:54:08,570 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-02-03 22:54:08,570 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 28 states. [2018-02-03 22:54:09,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 22:54:09,179 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-02-03 22:54:09,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-03 22:54:09,180 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 40 [2018-02-03 22:54:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 22:54:09,180 INFO L225 Difference]: With dead ends: 41 [2018-02-03 22:54:09,180 INFO L226 Difference]: Without dead ends: 0 [2018-02-03 22:54:09,180 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=233, Invalid=1573, Unknown=0, NotChecked=0, Total=1806 [2018-02-03 22:54:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-03 22:54:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-03 22:54:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-03 22:54:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-03 22:54:09,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-02-03 22:54:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 22:54:09,181 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-03 22:54:09,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-03 22:54:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-03 22:54:09,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-03 22:54:09,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 10:54:09 BoogieIcfgContainer [2018-02-03 22:54:09,185 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 22:54:09,186 INFO L168 Benchmark]: Toolchain (without parser) took 12534.35 ms. Allocated memory was 394.8 MB in the beginning and 743.4 MB in the end (delta: 348.7 MB). Free memory was 353.0 MB in the beginning and 571.6 MB in the end (delta: -218.6 MB). Peak memory consumption was 130.0 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:09,187 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 394.8 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 22:54:09,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.56 ms. Allocated memory is still 394.8 MB. Free memory was 351.7 MB in the beginning and 341.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:09,187 INFO L168 Benchmark]: Boogie Preprocessor took 22.59 ms. Allocated memory is still 394.8 MB. Free memory was 341.1 MB in the beginning and 339.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:09,187 INFO L168 Benchmark]: RCFGBuilder took 231.39 ms. Allocated memory is still 394.8 MB. Free memory was 339.8 MB in the beginning and 319.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:09,188 INFO L168 Benchmark]: TraceAbstraction took 12120.85 ms. Allocated memory was 394.8 MB in the beginning and 743.4 MB in the end (delta: 348.7 MB). Free memory was 319.1 MB in the beginning and 571.6 MB in the end (delta: -252.5 MB). Peak memory consumption was 96.1 MB. Max. memory is 5.3 GB. [2018-02-03 22:54:09,189 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.21 ms. Allocated memory is still 394.8 MB. Free memory is still 358.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 156.56 ms. Allocated memory is still 394.8 MB. Free memory was 351.7 MB in the beginning and 341.1 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 22.59 ms. Allocated memory is still 394.8 MB. Free memory was 341.1 MB in the beginning and 339.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 231.39 ms. Allocated memory is still 394.8 MB. Free memory was 339.8 MB in the beginning and 319.1 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 12120.85 ms. Allocated memory was 394.8 MB in the beginning and 743.4 MB in the end (delta: 348.7 MB). Free memory was 319.1 MB in the beginning and 571.6 MB in the end (delta: -252.5 MB). Peak memory consumption was 96.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: 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, 58 locations, 15 error locations. SAFE Result, 12.0s OverallTime, 20 OverallIterations, 3 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 706 SDtfs, 1087 SDslu, 2814 SDs, 0 SdLazy, 2488 SolverSat, 171 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 180 SyntacticMatches, 4 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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, 20 MinimizatonAttempts, 37 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 679 ConstructedInterpolants, 60 QuantifiedInterpolants, 199701 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1013 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 25/96 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/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_22-54-09-195.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncmp-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_22-54-09-195.csv Received shutdown request...