java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:45:19,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:45:19,058 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:45:19,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:45:19,068 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:45:19,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:45:19,069 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:45:19,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:45:19,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:45:19,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:45:19,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:45:19,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:45:19,074 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:45:19,075 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:45:19,076 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:45:19,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:45:19,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:45:19,081 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:45:19,082 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:45:19,083 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:45:19,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:45:19,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:45:19,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:45:19,086 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:45:19,087 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:45:19,088 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:45:19,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:45:19,088 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:45:19,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:45:19,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:45:19,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:45:19,089 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:45:19,099 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:45:19,099 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:45:19,100 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:45:19,100 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:45:19,101 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:45:19,101 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:45:19,101 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:45:19,101 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:45:19,101 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:45:19,101 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:45:19,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:45:19,102 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:45:19,102 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:45:19,102 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:45:19,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:45:19,102 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:45:19,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:45:19,103 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:45:19,103 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:45:19,103 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:45:19,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:45:19,103 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:45:19,103 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:45:19,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:45:19,104 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:45:19,130 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:45:19,141 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:45:19,144 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:45:19,145 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:45:19,146 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:45:19,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:45:19,366 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:45:19,367 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:45:19,368 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:45:19,368 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:45:19,372 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:45:19,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:45:19" (1/1) ... [2018-02-02 08:45:19,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f34542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19, skipping insertion in model container [2018-02-02 08:45:19,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:45:19" (1/1) ... [2018-02-02 08:45:19,384 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:45:19,410 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:45:19,499 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:45:19,510 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:45:19,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19 WrapperNode [2018-02-02 08:45:19,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:45:19,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:45:19,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:45:19,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:45:19,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19" (1/1) ... [2018-02-02 08:45:19,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19" (1/1) ... [2018-02-02 08:45:19,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19" (1/1) ... [2018-02-02 08:45:19,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19" (1/1) ... [2018-02-02 08:45:19,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19" (1/1) ... [2018-02-02 08:45:19,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19" (1/1) ... [2018-02-02 08:45:19,542 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19" (1/1) ... [2018-02-02 08:45:19,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:45:19,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:45:19,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:45:19,544 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:45:19,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:45:19,577 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:45:19,578 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:45:19,578 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-02-02 08:45:19,578 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:45:19,578 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:45:19,578 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:45:19,578 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:45:19,578 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:45:19,578 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:45:19,578 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:45:19,578 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-02-02 08:45:19,578 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:45:19,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:45:19,579 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:45:19,763 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:45:19,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:45:19 BoogieIcfgContainer [2018-02-02 08:45:19,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:45:19,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:45:19,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:45:19,767 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:45:19,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:45:19" (1/3) ... [2018-02-02 08:45:19,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c33f069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:45:19, skipping insertion in model container [2018-02-02 08:45:19,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:45:19" (2/3) ... [2018-02-02 08:45:19,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c33f069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:45:19, skipping insertion in model container [2018-02-02 08:45:19,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:45:19" (3/3) ... [2018-02-02 08:45:19,769 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-02 08:45:19,775 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:45:19,780 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-02 08:45:19,813 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:45:19,813 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:45:19,813 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:45:19,813 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:45:19,813 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:45:19,813 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:45:19,814 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:45:19,814 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:45:19,814 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:45:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-02 08:45:19,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:45:19,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:19,835 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:19,835 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:19,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-02-02 08:45:19,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:19,841 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:19,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:19,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:19,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:19,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:20,014 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:20,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:45:20,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:45:20,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:45:20,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:45:20,025 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-02-02 08:45:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:20,164 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-02 08:45:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:45:20,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-02 08:45:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:20,171 INFO L225 Difference]: With dead ends: 54 [2018-02-02 08:45:20,171 INFO L226 Difference]: Without dead ends: 51 [2018-02-02 08:45:20,172 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:45:20,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-02 08:45:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-02 08:45:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-02 08:45:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-02 08:45:20,198 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-02-02 08:45:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:20,198 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-02 08:45:20,201 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:45:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-02 08:45:20,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 08:45:20,201 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:20,202 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:20,202 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:20,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-02-02 08:45:20,202 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:20,202 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:20,203 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,203 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:20,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:20,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:20,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:20,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:45:20,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:45:20,319 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:45:20,319 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:45:20,320 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-02-02 08:45:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:20,377 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-02-02 08:45:20,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:45:20,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-02 08:45:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:20,378 INFO L225 Difference]: With dead ends: 50 [2018-02-02 08:45:20,378 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 08:45:20,379 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:45:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 08:45:20,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-02 08:45:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 08:45:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-02 08:45:20,383 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-02-02 08:45:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:20,384 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-02 08:45:20,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:45:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-02 08:45:20,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:45:20,384 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:20,385 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:20,385 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:20,385 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-02-02 08:45:20,385 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:20,385 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:20,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,386 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:20,386 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:20,397 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:20,417 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:20,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:45:20,418 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:45:20,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:45:20,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:45:20,418 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-02-02 08:45:20,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:20,453 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-02-02 08:45:20,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:45:20,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-02 08:45:20,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:20,453 INFO L225 Difference]: With dead ends: 49 [2018-02-02 08:45:20,453 INFO L226 Difference]: Without dead ends: 49 [2018-02-02 08:45:20,454 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:45:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-02 08:45:20,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-02 08:45:20,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-02 08:45:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-02-02 08:45:20,456 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-02-02 08:45:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:20,456 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-02-02 08:45:20,457 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:45:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-02-02 08:45:20,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 08:45:20,457 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:20,457 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:20,457 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:20,457 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-02-02 08:45:20,457 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:20,457 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:20,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,458 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:20,458 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:20,465 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:20,517 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:20,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:45:20,517 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:45:20,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:45:20,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:45:20,517 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-02-02 08:45:20,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:20,560 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-02-02 08:45:20,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:45:20,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-02 08:45:20,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:20,562 INFO L225 Difference]: With dead ends: 48 [2018-02-02 08:45:20,569 INFO L226 Difference]: Without dead ends: 48 [2018-02-02 08:45:20,569 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:45:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-02 08:45:20,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-02 08:45:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-02 08:45:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-02 08:45:20,573 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-02-02 08:45:20,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:20,574 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-02 08:45:20,574 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:45:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-02 08:45:20,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 08:45:20,577 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:20,578 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-02 08:45:20,578 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:20,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-02-02 08:45:20,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:20,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:20,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:20,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:20,605 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:20,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:20,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:45:20,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:45:20,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:45:20,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:45:20,647 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-02-02 08:45:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:20,694 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-02-02 08:45:20,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:45:20,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 08:45:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:20,695 INFO L225 Difference]: With dead ends: 47 [2018-02-02 08:45:20,695 INFO L226 Difference]: Without dead ends: 47 [2018-02-02 08:45:20,695 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:45:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-02 08:45:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-02 08:45:20,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-02 08:45:20,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-02-02 08:45:20,697 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-02-02 08:45:20,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:20,698 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-02-02 08:45:20,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:45:20,698 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-02-02 08:45:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 08:45:20,698 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:20,698 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-02 08:45:20,698 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:20,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-02-02 08:45:20,698 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:20,698 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:20,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,699 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:20,699 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:20,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:20,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:20,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:45:20,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:45:20,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:45:20,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:45:20,778 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-02-02 08:45:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:20,859 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-02 08:45:20,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:45:20,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-02 08:45:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:20,862 INFO L225 Difference]: With dead ends: 62 [2018-02-02 08:45:20,862 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 08:45:20,863 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:45:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 08:45:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-02 08:45:20,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 08:45:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 08:45:20,866 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-02-02 08:45:20,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:20,866 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 08:45:20,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:45:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 08:45:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 08:45:20,868 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:20,868 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] [2018-02-02 08:45:20,868 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:20,868 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-02-02 08:45:20,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:20,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:20,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:20,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:20,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:20,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-02 08:45:20,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:20,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:45:20,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:45:20,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:45:20,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:45:20,912 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-02 08:45:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:20,971 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 08:45:20,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:45:20,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-02 08:45:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:20,972 INFO L225 Difference]: With dead ends: 52 [2018-02-02 08:45:20,972 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 08:45:20,973 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-02 08:45:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 08:45:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 08:45:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 08:45:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-02 08:45:20,977 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-02-02 08:45:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:20,977 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-02 08:45:20,977 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:45:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-02 08:45:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 08:45:20,978 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:20,978 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] [2018-02-02 08:45:20,978 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:20,978 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-02-02 08:45:20,978 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:20,978 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:20,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:20,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:20,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:21,064 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:21,064 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:45:21,065 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:45:21,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:45:21,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:45:21,065 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-02 08:45:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:21,159 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-02 08:45:21,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:45:21,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-02 08:45:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:21,160 INFO L225 Difference]: With dead ends: 62 [2018-02-02 08:45:21,160 INFO L226 Difference]: Without dead ends: 62 [2018-02-02 08:45:21,161 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-02 08:45:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-02 08:45:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-02 08:45:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 08:45:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 08:45:21,164 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-02-02 08:45:21,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:21,164 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 08:45:21,164 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:45:21,164 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 08:45:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:45:21,165 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:21,165 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:21,165 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-02-02 08:45:21,165 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:21,165 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:21,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:21,166 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:21,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:21,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:21,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:45:21,239 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:45:21,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:45:21,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:45:21,239 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-02 08:45:21,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:21,285 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 08:45:21,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:45:21,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 08:45:21,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:21,286 INFO L225 Difference]: With dead ends: 52 [2018-02-02 08:45:21,286 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 08:45:21,286 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-02 08:45:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 08:45:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 08:45:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 08:45:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-02 08:45:21,288 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-02 08:45:21,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:21,288 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-02 08:45:21,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:45:21,289 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-02 08:45:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:45:21,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:21,289 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:21,289 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:21,290 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-02-02 08:45:21,290 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:21,290 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:21,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,291 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:21,291 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:21,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:21,371 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:21,371 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:45:21,371 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:45:21,371 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:45:21,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:45:21,371 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-02 08:45:21,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:21,457 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-02-02 08:45:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:45:21,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 08:45:21,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:21,458 INFO L225 Difference]: With dead ends: 63 [2018-02-02 08:45:21,458 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 08:45:21,459 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-02-02 08:45:21,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 08:45:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-02-02 08:45:21,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-02 08:45:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-02 08:45:21,462 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-02-02 08:45:21,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:21,463 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-02 08:45:21,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:45:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-02 08:45:21,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:45:21,464 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:21,464 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:21,464 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:21,464 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-02-02 08:45:21,464 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:21,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:21,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:21,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:21,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:21,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:21,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:21,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:45:21,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:45:21,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:45:21,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:45:21,516 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-02 08:45:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:21,610 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-02 08:45:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:45:21,611 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-02 08:45:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:21,611 INFO L225 Difference]: With dead ends: 52 [2018-02-02 08:45:21,611 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 08:45:21,612 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-02 08:45:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 08:45:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 08:45:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 08:45:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-02 08:45:21,614 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-02 08:45:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:21,614 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-02 08:45:21,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:45:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-02 08:45:21,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:45:21,614 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:21,614 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:21,614 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:21,615 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-02-02 08:45:21,615 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:21,615 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:21,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:21,615 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:21,623 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:21,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:21,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:45:21,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:45:21,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:45:21,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:45:21,697 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-02 08:45:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:21,776 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-02-02 08:45:21,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:45:21,776 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-02 08:45:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:21,776 INFO L225 Difference]: With dead ends: 59 [2018-02-02 08:45:21,777 INFO L226 Difference]: Without dead ends: 59 [2018-02-02 08:45:21,777 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-02 08:45:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-02 08:45:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-02 08:45:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-02 08:45:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-02-02 08:45:21,779 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-02-02 08:45:21,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:21,780 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-02-02 08:45:21,780 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:45:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-02-02 08:45:21,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 08:45:21,780 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:21,781 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:21,781 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:21,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-02-02 08:45:21,781 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:21,781 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:21,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,782 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:21,782 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:21,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:21,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:21,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 08:45:21,960 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:45:21,960 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:45:21,960 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:45:21,960 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 12 states. [2018-02-02 08:45:22,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:22,203 INFO L93 Difference]: Finished difference Result 132 states and 159 transitions. [2018-02-02 08:45:22,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:45:22,203 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-02 08:45:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:22,204 INFO L225 Difference]: With dead ends: 132 [2018-02-02 08:45:22,204 INFO L226 Difference]: Without dead ends: 132 [2018-02-02 08:45:22,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-02-02 08:45:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-02 08:45:22,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2018-02-02 08:45:22,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 08:45:22,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-02-02 08:45:22,208 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 26 [2018-02-02 08:45:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:22,211 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-02-02 08:45:22,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:45:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-02-02 08:45:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 08:45:22,212 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:22,212 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:22,212 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-02-02 08:45:22,213 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:22,213 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:22,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:22,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:22,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:22,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:45:22,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:22,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:45:22,262 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:45:22,262 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:45:22,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:45:22,262 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 6 states. [2018-02-02 08:45:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:22,279 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-02-02 08:45:22,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:45:22,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-02 08:45:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:22,280 INFO L225 Difference]: With dead ends: 99 [2018-02-02 08:45:22,280 INFO L226 Difference]: Without dead ends: 99 [2018-02-02 08:45:22,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:45:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-02 08:45:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-02 08:45:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-02 08:45:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2018-02-02 08:45:22,284 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 26 [2018-02-02 08:45:22,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:22,285 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2018-02-02 08:45:22,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:45:22,285 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2018-02-02 08:45:22,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 08:45:22,286 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:22,286 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:22,286 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:22,286 INFO L82 PathProgramCache]: Analyzing trace with hash 717809756, now seen corresponding path program 1 times [2018-02-02 08:45:22,286 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:22,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:22,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:22,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:22,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:22,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:22,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:22,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:45:22,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:45:22,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:45:22,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:45:22,435 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand 11 states. [2018-02-02 08:45:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:22,575 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-02-02 08:45:22,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:45:22,575 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-02-02 08:45:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:22,576 INFO L225 Difference]: With dead ends: 121 [2018-02-02 08:45:22,576 INFO L226 Difference]: Without dead ends: 121 [2018-02-02 08:45:22,576 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:45:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-02 08:45:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 62. [2018-02-02 08:45:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-02 08:45:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-02-02 08:45:22,579 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 26 [2018-02-02 08:45:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:22,579 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-02-02 08:45:22,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:45:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-02-02 08:45:22,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 08:45:22,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:22,580 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] [2018-02-02 08:45:22,580 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:22,581 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-02-02 08:45:22,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:22,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:22,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:22,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:22,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:22,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:22,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:22,693 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:22,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:45:22,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:45:22,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:45:22,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:45:22,694 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 10 states. [2018-02-02 08:45:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:22,791 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-02-02 08:45:22,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:45:22,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-02 08:45:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:22,791 INFO L225 Difference]: With dead ends: 105 [2018-02-02 08:45:22,791 INFO L226 Difference]: Without dead ends: 105 [2018-02-02 08:45:22,792 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:45:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-02 08:45:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-02-02 08:45:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-02 08:45:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2018-02-02 08:45:22,795 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 27 [2018-02-02 08:45:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:22,795 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2018-02-02 08:45:22,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:45:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-02-02 08:45:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 08:45:22,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:22,796 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] [2018-02-02 08:45:22,796 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-02-02 08:45:22,796 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:22,797 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:22,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:22,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:22,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:22,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:22,952 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:22,952 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:45:22,964 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:22,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:23,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-02 08:45:23,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 08:45:23,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:23,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:23,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:23,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-02 08:45:23,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-02 08:45:23,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:45:23,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:45:23,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:23,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:23,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-02 08:45:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:23,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:23,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-02-02 08:45:23,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 08:45:23,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 08:45:23,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:45:23,287 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand 17 states. [2018-02-02 08:45:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:26,722 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2018-02-02 08:45:26,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:45:26,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-02-02 08:45:26,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:26,723 INFO L225 Difference]: With dead ends: 134 [2018-02-02 08:45:26,723 INFO L226 Difference]: Without dead ends: 134 [2018-02-02 08:45:26,724 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:45:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-02 08:45:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2018-02-02 08:45:26,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 08:45:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2018-02-02 08:45:26,727 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 27 [2018-02-02 08:45:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:26,728 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2018-02-02 08:45:26,728 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 08:45:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2018-02-02 08:45:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:45:26,728 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:26,728 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:26,728 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:26,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1893257598, now seen corresponding path program 1 times [2018-02-02 08:45:26,729 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:26,729 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:26,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:26,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:26,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:26,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:26,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:26,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:45:26,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:45:26,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:45:26,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:45:26,794 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 5 states. [2018-02-02 08:45:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:26,805 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2018-02-02 08:45:26,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:45:26,805 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-02 08:45:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:26,806 INFO L225 Difference]: With dead ends: 95 [2018-02-02 08:45:26,806 INFO L226 Difference]: Without dead ends: 95 [2018-02-02 08:45:26,806 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:45:26,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-02 08:45:26,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-02 08:45:26,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 08:45:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-02-02 08:45:26,810 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 28 [2018-02-02 08:45:26,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:26,810 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-02-02 08:45:26,810 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:45:26,810 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-02-02 08:45:26,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 08:45:26,813 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:26,813 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] [2018-02-02 08:45:26,814 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:26,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1643094554, now seen corresponding path program 1 times [2018-02-02 08:45:26,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:26,814 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:26,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:26,815 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:26,815 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:26,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:26,995 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:26,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:26,996 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:45:27,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:27,025 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:27,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:27,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:27,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:27,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:27,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:27,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:45:27,073 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:27,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:45:27,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:27,084 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:27,085 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:27,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:45:27,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:27,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:27,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:45:27,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:27,226 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:27,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-02-02 08:45:27,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:45:27,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:45:27,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:45:27,227 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 22 states. [2018-02-02 08:45:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:27,813 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-02-02 08:45:27,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:45:27,814 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-02-02 08:45:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:27,815 INFO L225 Difference]: With dead ends: 112 [2018-02-02 08:45:27,815 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 08:45:27,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2018-02-02 08:45:27,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 08:45:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-02-02 08:45:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-02 08:45:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-02 08:45:27,819 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-02-02 08:45:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:27,819 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-02 08:45:27,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:45:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-02 08:45:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-02 08:45:27,820 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:27,820 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:27,820 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1433698709, now seen corresponding path program 1 times [2018-02-02 08:45:27,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:27,821 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:27,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:27,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:27,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:27,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:27,831 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:28,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:28,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:28,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-02 08:45:28,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:45:28,009 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:45:28,009 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:45:28,010 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 12 states. [2018-02-02 08:45:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:28,282 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-02 08:45:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 08:45:28,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-02-02 08:45:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:28,283 INFO L225 Difference]: With dead ends: 113 [2018-02-02 08:45:28,283 INFO L226 Difference]: Without dead ends: 109 [2018-02-02 08:45:28,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-02-02 08:45:28,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-02 08:45:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-02-02 08:45:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-02 08:45:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-02-02 08:45:28,287 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-02-02 08:45:28,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:28,287 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-02-02 08:45:28,287 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:45:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-02-02 08:45:28,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:45:28,288 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:28,288 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:28,288 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash -163894416, now seen corresponding path program 1 times [2018-02-02 08:45:28,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:28,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:28,289 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:28,289 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:28,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:28,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:28,462 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:28,462 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 08:45:28,462 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 08:45:28,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 08:45:28,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:45:28,462 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-02-02 08:45:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:28,687 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-02-02 08:45:28,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-02 08:45:28,688 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 08:45:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:28,688 INFO L225 Difference]: With dead ends: 112 [2018-02-02 08:45:28,688 INFO L226 Difference]: Without dead ends: 112 [2018-02-02 08:45:28,689 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:45:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-02 08:45:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-02-02 08:45:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-02 08:45:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-02-02 08:45:28,691 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-02-02 08:45:28,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:28,691 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-02-02 08:45:28,691 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 08:45:28,691 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-02-02 08:45:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:45:28,691 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:28,691 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:28,691 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash 215739387, now seen corresponding path program 1 times [2018-02-02 08:45:28,692 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:28,692 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:28,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:28,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:28,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:28,699 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:28,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:45:28,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:45:28,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 08:45:28,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 08:45:28,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:45:28,771 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 6 states. [2018-02-02 08:45:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:28,847 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-02-02 08:45:28,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:45:28,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-02 08:45:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:28,850 INFO L225 Difference]: With dead ends: 91 [2018-02-02 08:45:28,850 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 08:45:28,850 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:45:28,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 08:45:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-02 08:45:28,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-02 08:45:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-02 08:45:28,852 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2018-02-02 08:45:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:28,852 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-02 08:45:28,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 08:45:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-02 08:45:28,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 08:45:28,853 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:28,853 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:28,853 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash -297907922, now seen corresponding path program 1 times [2018-02-02 08:45:28,853 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:28,853 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:28,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:28,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:28,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:28,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:29,057 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:29,057 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:45:29,061 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:29,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:29,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:29,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:29,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:29,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:45:29,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:29,092 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:29,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:45:29,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:29,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:29,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-02 08:45:29,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-02 08:45:29,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 08:45:29,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:29,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:29,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:29,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-02 08:45:29,210 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 22 treesize of output 23 [2018-02-02 08:45:29,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:45:29,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:29,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:29,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:29,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-02 08:45:29,308 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 27 treesize of output 25 [2018-02-02 08:45:29,312 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 5 treesize of output 1 [2018-02-02 08:45:29,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:29,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:45:29,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:45:29,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:29,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:29,332 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-02-02 08:45:29,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:29,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:29,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-02-02 08:45:29,380 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 08:45:29,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 08:45:29,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:45:29,381 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 23 states. [2018-02-02 08:45:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:30,238 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-02 08:45:30,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:45:30,239 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-02-02 08:45:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:30,239 INFO L225 Difference]: With dead ends: 64 [2018-02-02 08:45:30,239 INFO L226 Difference]: Without dead ends: 64 [2018-02-02 08:45:30,239 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:45:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-02 08:45:30,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-02-02 08:45:30,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 08:45:30,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-02 08:45:30,241 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 30 [2018-02-02 08:45:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:30,241 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-02 08:45:30,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 08:45:30,241 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-02 08:45:30,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 08:45:30,241 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:30,241 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:30,241 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:30,241 INFO L82 PathProgramCache]: Analyzing trace with hash -119267187, now seen corresponding path program 1 times [2018-02-02 08:45:30,241 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:30,241 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:30,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:30,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:30,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:30,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:30,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:30,346 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:45:30,350 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:30,365 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:30,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-02-02 08:45:30,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-02 08:45:30,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:30,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:30,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:30,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-02 08:45:30,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-02-02 08:45:30,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:45:30,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:45:30,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:30,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:30,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-02 08:45:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:30,505 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:30,505 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-02-02 08:45:30,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 08:45:30,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 08:45:30,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:45:30,505 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 17 states. [2018-02-02 08:45:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:30,923 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-02-02 08:45:30,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:45:30,923 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-02-02 08:45:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:30,923 INFO L225 Difference]: With dead ends: 67 [2018-02-02 08:45:30,923 INFO L226 Difference]: Without dead ends: 67 [2018-02-02 08:45:30,924 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2018-02-02 08:45:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-02 08:45:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-02 08:45:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-02 08:45:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-02 08:45:30,925 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 32 [2018-02-02 08:45:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:30,925 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-02 08:45:30,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 08:45:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-02 08:45:30,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-02 08:45:30,925 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:30,925 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] [2018-02-02 08:45:30,925 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1093780658, now seen corresponding path program 1 times [2018-02-02 08:45:30,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:30,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:30,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:30,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:30,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:30,932 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:31,063 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-02 08:45:31,064 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:31,064 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 08:45:31,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:31,081 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:31,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-02 08:45:31,119 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:45:31,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2018-02-02 08:45:31,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:45:31,119 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:45:31,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-02 08:45:31,119 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 15 states. [2018-02-02 08:45:31,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:31,552 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-02-02 08:45:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 08:45:31,552 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-02-02 08:45:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:31,553 INFO L225 Difference]: With dead ends: 80 [2018-02-02 08:45:31,553 INFO L226 Difference]: Without dead ends: 78 [2018-02-02 08:45:31,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2018-02-02 08:45:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-02 08:45:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2018-02-02 08:45:31,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-02 08:45:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-02 08:45:31,555 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-02-02 08:45:31,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:31,555 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-02 08:45:31,555 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:45:31,555 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-02 08:45:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-02 08:45:31,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:31,556 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:31,556 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:31,556 INFO L82 PathProgramCache]: Analyzing trace with hash -451522982, now seen corresponding path program 2 times [2018-02-02 08:45:31,556 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:31,556 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:31,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:31,557 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:31,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:31,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:31,865 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:31,865 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02 08:45:31,870 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:45:31,895 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:45:31,902 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:45:31,904 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:45:31,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:31,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:31,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:31,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:31,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:45:31,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:31,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:31,938 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:31,939 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:31,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:45:31,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:31,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:31,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-02 08:45:31,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:45:31,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 08:45:32,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:32,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:32,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:32,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-02 08:45:32,162 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 24 treesize of output 25 [2018-02-02 08:45:32,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:45:32,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:32,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:32,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:32,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-02 08:45:32,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-02 08:45:32,275 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-02 08:45:32,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:45:32,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:32,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:32,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-02 08:45:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:32,338 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:32,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-02-02 08:45:32,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:45:32,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:45:32,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:45:32,339 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 26 states. [2018-02-02 08:45:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:33,260 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-02-02 08:45:33,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 08:45:33,260 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-02-02 08:45:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:33,261 INFO L225 Difference]: With dead ends: 74 [2018-02-02 08:45:33,261 INFO L226 Difference]: Without dead ends: 74 [2018-02-02 08:45:33,261 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=1595, Unknown=0, NotChecked=0, Total=1806 [2018-02-02 08:45:33,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-02 08:45:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-02-02 08:45:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-02 08:45:33,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-02 08:45:33,263 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 33 [2018-02-02 08:45:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:33,264 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-02 08:45:33,264 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 08:45:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-02 08:45:33,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 08:45:33,264 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:33,264 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:33,264 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:33,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1502086491, now seen corresponding path program 2 times [2018-02-02 08:45:33,265 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:33,265 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:33,265 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:33,266 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:45:33,266 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:33,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:33,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:33,819 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:45:33,824 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:45:33,833 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:45:33,840 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:45:33,841 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:45:33,844 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:33,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:33,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:33,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:33,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:45:33,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:33,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:33,876 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:33,877 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:33,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:45:33,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:33,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:33,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-02 08:45:33,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:45:33,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 08:45:33,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:33,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:33,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:33,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-02 08:45:34,004 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 24 treesize of output 25 [2018-02-02 08:45:34,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:45:34,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:34,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:34,027 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-02 08:45:34,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:30 [2018-02-02 08:45:34,202 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 29 treesize of output 27 [2018-02-02 08:45:34,206 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-02 08:45:34,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:45:34,212 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 5 treesize of output 1 [2018-02-02 08:45:34,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:34,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:34,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:34,222 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-02-02 08:45:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:34,279 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:34,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2018-02-02 08:45:34,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-02 08:45:34,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-02 08:45:34,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2018-02-02 08:45:34,280 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 32 states. [2018-02-02 08:45:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:35,100 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-02 08:45:35,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-02 08:45:35,100 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-02-02 08:45:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:35,101 INFO L225 Difference]: With dead ends: 72 [2018-02-02 08:45:35,101 INFO L226 Difference]: Without dead ends: 57 [2018-02-02 08:45:35,101 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 08:45:35,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-02 08:45:35,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-02 08:45:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-02 08:45:35,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-02 08:45:35,103 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2018-02-02 08:45:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:35,103 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-02 08:45:35,103 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-02 08:45:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-02 08:45:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-02 08:45:35,104 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:35,104 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:35,104 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:35,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1112310596, now seen corresponding path program 2 times [2018-02-02 08:45:35,104 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:35,104 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:35,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:35,105 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:45:35,105 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:35,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:35,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:35,315 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:45:35,319 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:45:35,328 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:45:35,334 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:45:35,337 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:45:35,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:35,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:35,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:35,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:35,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:35,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:35,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:45:35,356 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:35,357 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:35,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:45:35,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:35,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:45:35,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:35,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:35,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:45:35,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:35,587 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:35,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2018-02-02 08:45:35,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-02 08:45:35,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-02 08:45:35,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:45:35,587 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 21 states. [2018-02-02 08:45:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:35,991 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-02 08:45:35,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-02 08:45:35,991 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-02-02 08:45:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:35,992 INFO L225 Difference]: With dead ends: 65 [2018-02-02 08:45:35,992 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 08:45:35,992 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-02-02 08:45:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 08:45:35,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-02-02 08:45:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-02 08:45:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-02-02 08:45:35,993 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2018-02-02 08:45:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:35,993 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-02-02 08:45:35,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-02 08:45:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-02-02 08:45:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-02 08:45:35,994 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:35,994 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, 1] [2018-02-02 08:45:35,994 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1315632508, now seen corresponding path program 1 times [2018-02-02 08:45:35,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:35,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:35,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:35,994 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:45:35,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:36,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:36,319 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-02 08:45:36,319 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:36,319 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:45:36,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:36,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:36,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:36,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:45:36,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:36,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:36,360 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:36,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:45:36,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-02 08:45:36,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-02-02 08:45:36,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-02-02 08:45:36,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-02 08:45:36,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-02 08:45:36,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:45:36,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-02-02 08:45:36,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-02-02 08:45:36,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:45:36,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:36,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-02 08:45:36,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-02-02 08:45:36,611 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 5 treesize of output 1 [2018-02-02 08:45:36,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:36,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-02-02 08:45:36,623 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 08:45:36,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:36,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:36,634 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-02-02 08:45:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:36,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:36,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-02-02 08:45:36,706 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 08:45:36,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 08:45:36,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-02-02 08:45:36,706 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 27 states. [2018-02-02 08:45:37,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:37,443 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-02-02 08:45:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:45:37,648 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-02-02 08:45:37,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:37,649 INFO L225 Difference]: With dead ends: 64 [2018-02-02 08:45:37,649 INFO L226 Difference]: Without dead ends: 52 [2018-02-02 08:45:37,649 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=247, Invalid=1915, Unknown=0, NotChecked=0, Total=2162 [2018-02-02 08:45:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-02 08:45:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-02 08:45:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-02 08:45:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-02 08:45:37,650 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 36 [2018-02-02 08:45:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:37,650 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-02 08:45:37,651 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 08:45:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-02 08:45:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-02 08:45:37,651 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:37,651 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:37,651 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:37,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1099949155, now seen corresponding path program 2 times [2018-02-02 08:45:37,651 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:37,652 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:37,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:37,652 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:45:37,652 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:37,664 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:37,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:37,985 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:45:37,992 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:45:38,004 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:45:38,012 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:45:38,016 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:45:38,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:38,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:38,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:38,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:38,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:45:38,035 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:38,036 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:38,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:45:38,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:38,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 6 treesize of output 5 [2018-02-02 08:45:38,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:38,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:38,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-02 08:45:38,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-02-02 08:45:38,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-02-02 08:45:38,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:38,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:38,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:38,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-02 08:45:38,267 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 24 treesize of output 25 [2018-02-02 08:45:38,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-02 08:45:38,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:38,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:38,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:45:38,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-02 08:45:38,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-02-02 08:45:38,328 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-02 08:45:38,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-02 08:45:38,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:38,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:45:38,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-02 08:45:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:38,387 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:38,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-02-02 08:45:38,387 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:45:38,387 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:45:38,387 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:45:38,387 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-02-02 08:45:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:38,990 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-02-02 08:45:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:45:38,990 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-02-02 08:45:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:38,991 INFO L225 Difference]: With dead ends: 51 [2018-02-02 08:45:38,991 INFO L226 Difference]: Without dead ends: 45 [2018-02-02 08:45:38,991 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2018-02-02 08:45:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-02 08:45:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-02 08:45:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-02 08:45:38,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-02 08:45:38,992 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2018-02-02 08:45:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:38,993 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-02 08:45:38,993 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-02 08:45:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-02 08:45:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-02 08:45:38,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:45:38,993 INFO L351 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:45:38,993 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-02 08:45:38,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1971477742, now seen corresponding path program 3 times [2018-02-02 08:45:38,994 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:45:38,994 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:45:38,994 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:38,994 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:45:38,995 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:45:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:45:39,005 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:45:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:45:39,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:45:39,202 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:45:39,210 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:45:39,226 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:45:39,233 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:45:39,242 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:45:39,250 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:45:39,260 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:45:39,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:45:39,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:39,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:39,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:45:39,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:39,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:39,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-02 08:45:39,296 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:39,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-02-02 08:45:39,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:39,305 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:39,306 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:45:39,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:45:39,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:45:39,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:45:39,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-02 08:45:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:45:39,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:45:39,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-02-02 08:45:39,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 08:45:39,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 08:45:39,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-02-02 08:45:39,591 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 27 states. [2018-02-02 08:45:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:45:40,366 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-02 08:45:40,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-02 08:45:40,366 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-02-02 08:45:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:45:40,366 INFO L225 Difference]: With dead ends: 53 [2018-02-02 08:45:40,366 INFO L226 Difference]: Without dead ends: 0 [2018-02-02 08:45:40,367 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=2003, Unknown=0, NotChecked=0, Total=2256 [2018-02-02 08:45:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-02 08:45:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-02 08:45:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-02 08:45:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-02 08:45:40,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-02-02 08:45:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:45:40,367 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-02 08:45:40,367 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 08:45:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-02 08:45:40,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-02 08:45:40,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:45:40 BoogieIcfgContainer [2018-02-02 08:45:40,371 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:45:40,372 INFO L168 Benchmark]: Toolchain (without parser) took 21005.81 ms. Allocated memory was 401.6 MB in the beginning and 825.2 MB in the end (delta: 423.6 MB). Free memory was 359.8 MB in the beginning and 705.0 MB in the end (delta: -345.2 MB). Peak memory consumption was 78.4 MB. Max. memory is 5.3 GB. [2018-02-02 08:45:40,373 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:45:40,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.76 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:45:40,374 INFO L168 Benchmark]: Boogie Preprocessor took 27.55 ms. Allocated memory is still 401.6 MB. Free memory was 347.9 MB in the beginning and 346.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:45:40,374 INFO L168 Benchmark]: RCFGBuilder took 220.43 ms. Allocated memory is still 401.6 MB. Free memory was 346.6 MB in the beginning and 325.8 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. [2018-02-02 08:45:40,374 INFO L168 Benchmark]: TraceAbstraction took 20607.08 ms. Allocated memory was 401.6 MB in the beginning and 825.2 MB in the end (delta: 423.6 MB). Free memory was 325.8 MB in the beginning and 705.0 MB in the end (delta: -379.2 MB). Peak memory consumption was 44.4 MB. Max. memory is 5.3 GB. [2018-02-02 08:45:40,375 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.12 ms. Allocated memory is still 401.6 MB. Free memory is still 365.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.76 ms. Allocated memory is still 401.6 MB. Free memory was 358.5 MB in the beginning and 347.9 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 27.55 ms. Allocated memory is still 401.6 MB. Free memory was 347.9 MB in the beginning and 346.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 220.43 ms. Allocated memory is still 401.6 MB. Free memory was 346.6 MB in the beginning and 325.8 MB in the end (delta: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 20607.08 ms. Allocated memory was 401.6 MB in the beginning and 825.2 MB in the end (delta: 423.6 MB). Free memory was 325.8 MB in the beginning and 705.0 MB in the end (delta: -379.2 MB). Peak memory consumption was 44.4 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: 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: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 55 locations, 13 error locations. SAFE Result, 20.5s OverallTime, 31 OverallIterations, 4 TraceHistogramMax, 12.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1135 SDtfs, 2138 SDslu, 6507 SDs, 0 SdLazy, 6123 SolverSat, 510 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 290 SyntacticMatches, 17 SemanticMatches, 555 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=99occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 268 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1174 NumberOfCodeBlocks, 1174 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1132 ConstructedInterpolants, 79 QuantifiedInterpolants, 374337 SizeOfPredicates, 156 NumberOfNonLiveVariables, 1959 ConjunctsInSsa, 511 ConjunctsInUnsatCore, 42 InterpolantComputations, 21 PerfectInterpolantSequences, 25/234 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_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-45-40-382.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-45-40-382.csv Received shutdown request...