java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 12:07:22,284 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 12:07:22,285 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 12:07:22,298 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 12:07:22,298 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 12:07:22,299 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 12:07:22,299 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 12:07:22,301 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 12:07:22,303 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 12:07:22,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 12:07:22,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 12:07:22,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 12:07:22,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 12:07:22,306 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 12:07:22,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 12:07:22,309 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 12:07:22,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 12:07:22,312 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 12:07:22,313 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 12:07:22,314 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 12:07:22,315 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 12:07:22,316 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 12:07:22,316 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 12:07:22,317 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 12:07:22,317 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 12:07:22,318 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 12:07:22,318 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 12:07:22,319 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 12:07:22,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 12:07:22,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 12:07:22,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 12:07:22,320 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 12:07:22,329 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 12:07:22,329 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 12:07:22,330 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 12:07:22,330 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 12:07:22,330 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 12:07:22,331 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 12:07:22,331 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 12:07:22,331 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 12:07:22,331 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 12:07:22,331 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 12:07:22,331 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 12:07:22,332 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 12:07:22,332 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 12:07:22,332 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 12:07:22,332 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 12:07:22,332 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 12:07:22,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 12:07:22,332 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 12:07:22,333 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 12:07:22,333 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 12:07:22,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 12:07:22,333 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 12:07:22,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 12:07:22,333 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 12:07:22,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 12:07:22,371 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 12:07:22,374 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 12:07:22,375 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 12:07:22,375 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 12:07:22,376 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-04 12:07:22,497 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 12:07:22,497 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 12:07:22,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 12:07:22,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 12:07:22,502 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 12:07:22,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:07:22" (1/1) ... [2018-02-04 12:07:22,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51ad6ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22, skipping insertion in model container [2018-02-04 12:07:22,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:07:22" (1/1) ... [2018-02-04 12:07:22,514 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:07:22,541 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 12:07:22,629 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:07:22,641 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 12:07:22,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22 WrapperNode [2018-02-04 12:07:22,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 12:07:22,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 12:07:22,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 12:07:22,646 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 12:07:22,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22" (1/1) ... [2018-02-04 12:07:22,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22" (1/1) ... [2018-02-04 12:07:22,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22" (1/1) ... [2018-02-04 12:07:22,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22" (1/1) ... [2018-02-04 12:07:22,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22" (1/1) ... [2018-02-04 12:07:22,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22" (1/1) ... [2018-02-04 12:07:22,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22" (1/1) ... [2018-02-04 12:07:22,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 12:07:22,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 12:07:22,673 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 12:07:22,673 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 12:07:22,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22" (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-04 12:07:22,710 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 12:07:22,711 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 12:07:22,711 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-02-04 12:07:22,711 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 12:07:22,711 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 12:07:22,711 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 12:07:22,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 12:07:22,711 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 12:07:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 12:07:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 12:07:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-02-04 12:07:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 12:07:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 12:07:22,712 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 12:07:22,891 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 12:07:22,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:07:22 BoogieIcfgContainer [2018-02-04 12:07:22,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 12:07:22,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 12:07:22,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 12:07:22,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 12:07:22,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:07:22" (1/3) ... [2018-02-04 12:07:22,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1ca8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:07:22, skipping insertion in model container [2018-02-04 12:07:22,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:07:22" (2/3) ... [2018-02-04 12:07:22,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1ca8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:07:22, skipping insertion in model container [2018-02-04 12:07:22,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:07:22" (3/3) ... [2018-02-04 12:07:22,899 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-02-04 12:07:22,904 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 12:07:22,907 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-02-04 12:07:22,937 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 12:07:22,937 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 12:07:22,937 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 12:07:22,937 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 12:07:22,937 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 12:07:22,938 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 12:07:22,938 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 12:07:22,938 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 12:07:22,939 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 12:07:22,950 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-02-04 12:07:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:07:22,958 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:22,959 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:22,959 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:22,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619982, now seen corresponding path program 1 times [2018-02-04 12:07:22,965 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:22,965 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:23,008 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,008 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:23,009 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:23,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:23,177 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-04 12:07:23,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:23,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:07:23,180 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:07:23,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:07:23,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:07:23,190 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-02-04 12:07:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:23,325 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-02-04 12:07:23,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:07:23,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-02-04 12:07:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:23,331 INFO L225 Difference]: With dead ends: 54 [2018-02-04 12:07:23,332 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 12:07:23,333 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-04 12:07:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 12:07:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 12:07:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 12:07:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-02-04 12:07:23,360 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-02-04 12:07:23,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:23,360 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-02-04 12:07:23,360 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:07:23,360 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-02-04 12:07:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-04 12:07:23,360 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:23,360 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:23,361 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:23,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1536619983, now seen corresponding path program 1 times [2018-02-04 12:07:23,361 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:23,361 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:23,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,362 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:23,362 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:23,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:23,465 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-04 12:07:23,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:23,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:07:23,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:07:23,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:07:23,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:07:23,468 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-02-04 12:07:23,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:23,526 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-02-04 12:07:23,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:23,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-02-04 12:07:23,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:23,528 INFO L225 Difference]: With dead ends: 50 [2018-02-04 12:07:23,528 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 12:07:23,528 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-04 12:07:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 12:07:23,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-02-04 12:07:23,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-04 12:07:23,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-02-04 12:07:23,533 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-02-04 12:07:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:23,533 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-02-04 12:07:23,533 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:07:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-02-04 12:07:23,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:07:23,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:23,534 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:23,534 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:23,534 INFO L82 PathProgramCache]: Analyzing trace with hash 390579246, now seen corresponding path program 1 times [2018-02-04 12:07:23,534 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:23,534 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:23,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,535 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:23,535 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:23,545 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:23,574 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-04 12:07:23,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:23,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 12:07:23,575 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 12:07:23,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 12:07:23,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 12:07:23,576 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-02-04 12:07:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:23,618 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-02-04 12:07:23,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 12:07:23,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 12:07:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:23,619 INFO L225 Difference]: With dead ends: 49 [2018-02-04 12:07:23,619 INFO L226 Difference]: Without dead ends: 49 [2018-02-04 12:07:23,619 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-04 12:07:23,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-02-04 12:07:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-02-04 12:07:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 12:07:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-02-04 12:07:23,623 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-02-04 12:07:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:23,624 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-02-04 12:07:23,624 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 12:07:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-02-04 12:07:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 12:07:23,624 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:23,624 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 12:07:23,625 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash 390579247, now seen corresponding path program 1 times [2018-02-04 12:07:23,625 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:23,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:23,625 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,626 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:23,626 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:23,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:23,687 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-04 12:07:23,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:23,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:07:23,688 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:07:23,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:07:23,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:07:23,688 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-02-04 12:07:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:23,743 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-02-04 12:07:23,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:23,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 12:07:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:23,745 INFO L225 Difference]: With dead ends: 48 [2018-02-04 12:07:23,745 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 12:07:23,745 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-04 12:07:23,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 12:07:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 12:07:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 12:07:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-02-04 12:07:23,751 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-02-04 12:07:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:23,751 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-02-04 12:07:23,751 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:07:23,751 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-02-04 12:07:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:07:23,752 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:23,752 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-04 12:07:23,752 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:23,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349366, now seen corresponding path program 1 times [2018-02-04 12:07:23,752 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:23,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:23,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,753 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:23,753 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:23,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:23,796 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-04 12:07:23,796 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:23,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 12:07:23,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:07:23,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:07:23,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:07:23,797 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-02-04 12:07:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:23,838 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-02-04 12:07:23,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:07:23,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 12:07:23,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:23,840 INFO L225 Difference]: With dead ends: 47 [2018-02-04 12:07:23,840 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 12:07:23,840 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-04 12:07:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 12:07:23,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 12:07:23,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 12:07:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-02-04 12:07:23,843 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-02-04 12:07:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:23,843 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-02-04 12:07:23,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:07:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-02-04 12:07:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 12:07:23,844 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:23,844 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-04 12:07:23,844 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:23,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1961349365, now seen corresponding path program 1 times [2018-02-04 12:07:23,845 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:23,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:23,845 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,846 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:23,846 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:23,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:23,929 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-04 12:07:23,930 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:23,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 12:07:23,930 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 12:07:23,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 12:07:23,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 12:07:23,930 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-02-04 12:07:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:24,036 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-04 12:07:24,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:07:24,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-02-04 12:07:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:24,039 INFO L225 Difference]: With dead ends: 62 [2018-02-04 12:07:24,039 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 12:07:24,039 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-04 12:07:24,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 12:07:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-04 12:07:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:07:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-04 12:07:24,042 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-02-04 12:07:24,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:24,042 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-04 12:07:24,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 12:07:24,042 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-04 12:07:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:07:24,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:24,042 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-04 12:07:24,043 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:24,043 INFO L82 PathProgramCache]: Analyzing trace with hash -698055293, now seen corresponding path program 1 times [2018-02-04 12:07:24,043 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:24,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:24,043 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,043 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:24,043 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:24,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:24,099 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-04 12:07:24,099 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:24,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:07:24,100 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:07:24,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:07:24,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:07:24,101 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-04 12:07:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:24,179 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-04 12:07:24,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:24,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-02-04 12:07:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:24,181 INFO L225 Difference]: With dead ends: 52 [2018-02-04 12:07:24,181 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 12:07:24,181 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-04 12:07:24,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 12:07:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 12:07:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:07:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-04 12:07:24,184 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-02-04 12:07:24,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:24,184 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-04 12:07:24,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:07:24,184 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-04 12:07:24,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-04 12:07:24,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:24,184 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-04 12:07:24,184 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:24,184 INFO L82 PathProgramCache]: Analyzing trace with hash -698055292, now seen corresponding path program 1 times [2018-02-04 12:07:24,184 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:24,185 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:24,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,185 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:24,185 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:24,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:24,277 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-04 12:07:24,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:24,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:07:24,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:07:24,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:07:24,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:07:24,279 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-04 12:07:24,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:24,373 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-02-04 12:07:24,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:07:24,373 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-02-04 12:07:24,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:24,374 INFO L225 Difference]: With dead ends: 62 [2018-02-04 12:07:24,374 INFO L226 Difference]: Without dead ends: 62 [2018-02-04 12:07:24,375 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-04 12:07:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-02-04 12:07:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-02-04 12:07:24,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:07:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-04 12:07:24,378 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-02-04 12:07:24,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:24,378 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-04 12:07:24,378 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:07:24,378 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-04 12:07:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:07:24,379 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:24,379 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-04 12:07:24,379 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash -164877615, now seen corresponding path program 1 times [2018-02-04 12:07:24,379 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:24,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:24,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,380 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:24,380 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:24,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:24,421 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-04 12:07:24,421 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:24,422 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:07:24,422 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:07:24,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:07:24,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:07:24,422 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-04 12:07:24,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:24,485 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-04 12:07:24,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:24,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 12:07:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:24,486 INFO L225 Difference]: With dead ends: 52 [2018-02-04 12:07:24,487 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 12:07:24,487 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-04 12:07:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 12:07:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 12:07:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:07:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-04 12:07:24,489 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-04 12:07:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:24,490 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-04 12:07:24,490 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:07:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-04 12:07:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:07:24,490 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:24,490 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-04 12:07:24,490 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash -164877614, now seen corresponding path program 1 times [2018-02-04 12:07:24,491 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:24,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:24,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,492 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:24,492 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:24,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:24,578 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-04 12:07:24,578 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:24,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:07:24,578 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:07:24,579 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:07:24,579 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:07:24,579 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-04 12:07:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:24,684 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-02-04 12:07:24,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 12:07:24,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-04 12:07:24,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:24,685 INFO L225 Difference]: With dead ends: 63 [2018-02-04 12:07:24,685 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 12:07:24,685 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-04 12:07:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 12:07:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-02-04 12:07:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 12:07:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-02-04 12:07:24,688 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 22 [2018-02-04 12:07:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:24,689 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-02-04 12:07:24,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:07:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-02-04 12:07:24,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:07:24,689 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:24,690 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-04 12:07:24,690 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:24,690 INFO L82 PathProgramCache]: Analyzing trace with hash 634059438, now seen corresponding path program 1 times [2018-02-04 12:07:24,690 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:24,690 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:24,691 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,691 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:24,691 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:24,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:24,723 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-04 12:07:24,724 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:24,724 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:07:24,724 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:07:24,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:07:24,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:07:24,724 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-02-04 12:07:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:24,770 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-02-04 12:07:24,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:24,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-02-04 12:07:24,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:24,771 INFO L225 Difference]: With dead ends: 52 [2018-02-04 12:07:24,772 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 12:07:24,772 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-04 12:07:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 12:07:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 12:07:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:07:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-02-04 12:07:24,775 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-02-04 12:07:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:24,775 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-02-04 12:07:24,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:07:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-02-04 12:07:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-04 12:07:24,776 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:24,776 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-04 12:07:24,776 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash 634059439, now seen corresponding path program 1 times [2018-02-04 12:07:24,776 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:24,776 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:24,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,777 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:24,777 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:24,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:24,836 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-04 12:07:24,836 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:24,836 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-04 12:07:24,836 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 12:07:24,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 12:07:24,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-02-04 12:07:24,836 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-02-04 12:07:24,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:24,910 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-02-04 12:07:24,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 12:07:24,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-02-04 12:07:24,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:24,911 INFO L225 Difference]: With dead ends: 59 [2018-02-04 12:07:24,911 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 12:07:24,911 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-04 12:07:24,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 12:07:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-02-04 12:07:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 12:07:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-02-04 12:07:24,913 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-02-04 12:07:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:24,913 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-02-04 12:07:24,913 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 12:07:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-02-04 12:07:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:07:24,914 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:24,914 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-04 12:07:24,914 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:24,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1535458206, now seen corresponding path program 1 times [2018-02-04 12:07:24,914 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:24,914 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:24,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,914 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:24,914 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:24,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:25,052 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-04 12:07:25,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:25,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 12:07:25,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:07:25,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:07:25,053 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:07:25,053 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 12 states. [2018-02-04 12:07:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:25,307 INFO L93 Difference]: Finished difference Result 132 states and 159 transitions. [2018-02-04 12:07:25,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:07:25,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-02-04 12:07:25,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:25,308 INFO L225 Difference]: With dead ends: 132 [2018-02-04 12:07:25,308 INFO L226 Difference]: Without dead ends: 132 [2018-02-04 12:07:25,308 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-04 12:07:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-02-04 12:07:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2018-02-04 12:07:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 12:07:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 127 transitions. [2018-02-04 12:07:25,314 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 127 transitions. Word has length 26 [2018-02-04 12:07:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:25,314 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 127 transitions. [2018-02-04 12:07:25,314 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:07:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2018-02-04 12:07:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:07:25,315 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:25,315 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-04 12:07:25,316 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:25,316 INFO L82 PathProgramCache]: Analyzing trace with hash -44170330, now seen corresponding path program 1 times [2018-02-04 12:07:25,316 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:25,316 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:25,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:25,317 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:25,317 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:25,328 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:25,375 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-04 12:07:25,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:25,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 12:07:25,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:07:25,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:07:25,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:07:25,377 INFO L87 Difference]: Start difference. First operand 99 states and 127 transitions. Second operand 6 states. [2018-02-04 12:07:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:25,403 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-02-04 12:07:25,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 12:07:25,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-02-04 12:07:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:25,405 INFO L225 Difference]: With dead ends: 99 [2018-02-04 12:07:25,405 INFO L226 Difference]: Without dead ends: 99 [2018-02-04 12:07:25,405 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-04 12:07:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-02-04 12:07:25,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-02-04 12:07:25,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-02-04 12:07:25,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 125 transitions. [2018-02-04 12:07:25,411 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 125 transitions. Word has length 26 [2018-02-04 12:07:25,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:25,411 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 125 transitions. [2018-02-04 12:07:25,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:07:25,411 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 125 transitions. [2018-02-04 12:07:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 12:07:25,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:25,412 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-04 12:07:25,412 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash 717809756, now seen corresponding path program 1 times [2018-02-04 12:07:25,413 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:25,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:25,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:25,414 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:25,414 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:25,425 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:25,566 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-04 12:07:25,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:25,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:07:25,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-04 12:07:25,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-04 12:07:25,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-02-04 12:07:25,568 INFO L87 Difference]: Start difference. First operand 99 states and 125 transitions. Second operand 11 states. [2018-02-04 12:07:25,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:25,769 INFO L93 Difference]: Finished difference Result 121 states and 154 transitions. [2018-02-04 12:07:25,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:07:25,769 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-02-04 12:07:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:25,769 INFO L225 Difference]: With dead ends: 121 [2018-02-04 12:07:25,769 INFO L226 Difference]: Without dead ends: 121 [2018-02-04 12:07:25,770 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-04 12:07:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-02-04 12:07:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 62. [2018-02-04 12:07:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-02-04 12:07:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2018-02-04 12:07:25,772 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 26 [2018-02-04 12:07:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:25,773 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2018-02-04 12:07:25,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-04 12:07:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2018-02-04 12:07:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:07:25,773 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:25,774 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-04 12:07:25,774 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash 355579118, now seen corresponding path program 1 times [2018-02-04 12:07:25,774 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:25,774 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:25,775 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:25,775 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:25,775 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:25,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:25,880 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-04 12:07:25,880 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:25,880 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-04 12:07:25,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 12:07:25,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 12:07:25,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-04 12:07:25,881 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand 10 states. [2018-02-04 12:07:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:26,017 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-02-04 12:07:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 12:07:26,017 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-02-04 12:07:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:26,018 INFO L225 Difference]: With dead ends: 105 [2018-02-04 12:07:26,018 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 12:07:26,018 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-04 12:07:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 12:07:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2018-02-04 12:07:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-02-04 12:07:26,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2018-02-04 12:07:26,022 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 27 [2018-02-04 12:07:26,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:26,022 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2018-02-04 12:07:26,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 12:07:26,022 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2018-02-04 12:07:26,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 12:07:26,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:26,023 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-04 12:07:26,023 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash 778280944, now seen corresponding path program 1 times [2018-02-04 12:07:26,023 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:26,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:26,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:26,024 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:26,024 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:26,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:26,151 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-04 12:07:26,151 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:26,151 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:26,156 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:26,196 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:26,237 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-04 12:07:26,240 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-04 12:07:26,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:26,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:26,250 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-04 12:07:26,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:07:26,350 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-04 12:07:26,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, 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-04 12:07:26,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:26,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:26,372 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-04 12:07:26,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-04 12:07:26,410 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-04 12:07:26,440 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:26,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-02-04 12:07:26,440 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:07:26,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:07:26,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:07:26,441 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand 17 states. [2018-02-04 12:07:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:29,642 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2018-02-04 12:07:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:07:29,643 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2018-02-04 12:07:29,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:29,643 INFO L225 Difference]: With dead ends: 134 [2018-02-04 12:07:29,643 INFO L226 Difference]: Without dead ends: 134 [2018-02-04 12:07:29,644 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:07:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-02-04 12:07:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 95. [2018-02-04 12:07:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 12:07:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 116 transitions. [2018-02-04 12:07:29,647 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 116 transitions. Word has length 27 [2018-02-04 12:07:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:29,648 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 116 transitions. [2018-02-04 12:07:29,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:07:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 116 transitions. [2018-02-04 12:07:29,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:07:29,648 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:29,648 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-04 12:07:29,648 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:29,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1893257598, now seen corresponding path program 1 times [2018-02-04 12:07:29,649 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:29,649 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:29,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:29,649 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:29,649 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:29,660 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:29,702 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-04 12:07:29,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:29,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:07:29,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 12:07:29,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 12:07:29,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 12:07:29,703 INFO L87 Difference]: Start difference. First operand 95 states and 116 transitions. Second operand 5 states. [2018-02-04 12:07:29,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:29,713 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2018-02-04 12:07:29,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 12:07:29,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-02-04 12:07:29,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:29,714 INFO L225 Difference]: With dead ends: 95 [2018-02-04 12:07:29,714 INFO L226 Difference]: Without dead ends: 95 [2018-02-04 12:07:29,714 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-04 12:07:29,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-02-04 12:07:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-02-04 12:07:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 12:07:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-02-04 12:07:29,717 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 28 [2018-02-04 12:07:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:29,717 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-02-04 12:07:29,717 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 12:07:29,717 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-02-04 12:07:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-04 12:07:29,718 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:29,718 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-04 12:07:29,718 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1643094554, now seen corresponding path program 1 times [2018-02-04 12:07:29,719 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:29,719 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:29,719 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:29,719 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:29,720 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:29,729 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:29,850 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-04 12:07:29,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:29,851 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:29,856 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:29,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:29,876 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-04 12:07:29,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:29,886 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-04 12:07:29,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:29,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:29,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:07:29,907 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:29,909 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-04 12:07:29,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:29,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:29,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:29,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04 12:07:29,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:29,930 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-04 12:07:29,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:07:30,036 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-04 12:07:30,053 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:30,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-02-04 12:07:30,053 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-04 12:07:30,053 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-04 12:07:30,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-02-04 12:07:30,054 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 22 states. [2018-02-04 12:07:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:30,551 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-02-04 12:07:30,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 12:07:30,552 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-02-04 12:07:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:30,552 INFO L225 Difference]: With dead ends: 112 [2018-02-04 12:07:30,552 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 12:07:30,553 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2018-02-04 12:07:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 12:07:30,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 96. [2018-02-04 12:07:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-02-04 12:07:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2018-02-04 12:07:30,555 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 28 [2018-02-04 12:07:30,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:30,556 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2018-02-04 12:07:30,556 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-04 12:07:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2018-02-04 12:07:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 12:07:30,556 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:30,557 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-04 12:07:30,557 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:30,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1433698709, now seen corresponding path program 1 times [2018-02-04 12:07:30,557 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:30,557 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:30,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:30,558 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:30,558 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:30,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:30,716 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-04 12:07:30,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:30,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-02-04 12:07:30,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 12:07:30,716 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 12:07:30,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-02-04 12:07:30,717 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand 12 states. [2018-02-04 12:07:30,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:30,897 INFO L93 Difference]: Finished difference Result 113 states and 129 transitions. [2018-02-04 12:07:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 12:07:30,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-02-04 12:07:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:30,898 INFO L225 Difference]: With dead ends: 113 [2018-02-04 12:07:30,898 INFO L226 Difference]: Without dead ends: 109 [2018-02-04 12:07:30,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-02-04 12:07:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-02-04 12:07:30,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-02-04 12:07:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-02-04 12:07:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-02-04 12:07:30,901 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-02-04 12:07:30,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:30,901 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-02-04 12:07:30,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 12:07:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-02-04 12:07:30,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:07:30,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:30,902 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-04 12:07:30,902 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash -163894416, now seen corresponding path program 1 times [2018-02-04 12:07:30,902 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:30,902 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:30,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:30,903 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:30,903 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:30,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:31,061 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-04 12:07:31,062 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:31,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-04 12:07:31,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 12:07:31,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 12:07:31,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-02-04 12:07:31,063 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-02-04 12:07:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:31,332 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-02-04 12:07:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-02-04 12:07:31,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-04 12:07:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:31,333 INFO L225 Difference]: With dead ends: 112 [2018-02-04 12:07:31,333 INFO L226 Difference]: Without dead ends: 112 [2018-02-04 12:07:31,334 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-04 12:07:31,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-02-04 12:07:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-02-04 12:07:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-02-04 12:07:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-02-04 12:07:31,336 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-02-04 12:07:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:31,337 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-02-04 12:07:31,337 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 12:07:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-02-04 12:07:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:07:31,337 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:31,337 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-04 12:07:31,338 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:31,338 INFO L82 PathProgramCache]: Analyzing trace with hash 215739387, now seen corresponding path program 1 times [2018-02-04 12:07:31,338 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:31,338 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:31,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:31,339 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:31,339 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:31,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:31,392 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-04 12:07:31,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 12:07:31,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 12:07:31,393 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 12:07:31,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 12:07:31,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-04 12:07:31,393 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 6 states. [2018-02-04 12:07:31,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:31,490 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-02-04 12:07:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 12:07:31,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-02-04 12:07:31,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:31,493 INFO L225 Difference]: With dead ends: 91 [2018-02-04 12:07:31,493 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 12:07:31,493 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-04 12:07:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 12:07:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 12:07:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 12:07:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-02-04 12:07:31,494 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 30 [2018-02-04 12:07:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:31,494 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-02-04 12:07:31,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 12:07:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-02-04 12:07:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-04 12:07:31,495 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:31,495 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-04 12:07:31,495 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:31,495 INFO L82 PathProgramCache]: Analyzing trace with hash -297907922, now seen corresponding path program 1 times [2018-02-04 12:07:31,495 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:31,496 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:31,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:31,496 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:31,496 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:31,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:31,698 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-04 12:07:31,698 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:31,698 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:31,706 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:31,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:31,732 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-04 12:07:31,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:31,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:31,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-04 12:07:31,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:31,741 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:31,742 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-04 12:07:31,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:31,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:31,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-02-04 12:07:31,774 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-04 12:07:31,775 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-04 12:07:31,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:31,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:31,781 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-04 12:07:31,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-02-04 12:07:31,857 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-04 12:07:31,859 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-04 12:07:31,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:31,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:31,869 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-04 12:07:31,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-02-04 12:07:31,928 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-04 12:07:31,930 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-04 12:07:31,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:31,965 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-04 12:07:31,966 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:31,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:31,981 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-04 12:07:31,982 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-02-04 12:07:32,010 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-04 12:07:32,028 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:32,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2018-02-04 12:07:32,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-04 12:07:32,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-04 12:07:32,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2018-02-04 12:07:32,028 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 23 states. [2018-02-04 12:07:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:32,871 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-02-04 12:07:32,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:07:32,871 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-02-04 12:07:32,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:32,872 INFO L225 Difference]: With dead ends: 64 [2018-02-04 12:07:32,872 INFO L226 Difference]: Without dead ends: 64 [2018-02-04 12:07:32,872 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-04 12:07:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-02-04 12:07:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2018-02-04 12:07:32,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 12:07:32,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-04 12:07:32,873 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 30 [2018-02-04 12:07:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:32,873 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-04 12:07:32,873 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-04 12:07:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-04 12:07:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:07:32,873 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:32,874 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-04 12:07:32,874 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash -119267187, now seen corresponding path program 1 times [2018-02-04 12:07:32,874 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:32,874 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:32,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:32,874 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:32,874 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:32,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:33,029 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-04 12:07:33,030 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:33,030 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:33,035 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:33,050 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:33,069 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-04 12:07:33,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-02-04 12:07:33,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:33,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:33,079 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-04 12:07:33,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-02-04 12:07:33,152 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-04 12:07:33,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-04 12:07:33,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:33,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:33,164 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-04 12:07:33,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-02-04 12:07:33,188 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-04 12:07:33,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:33,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2018-02-04 12:07:33,205 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 12:07:33,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 12:07:33,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-02-04 12:07:33,205 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 17 states. [2018-02-04 12:07:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:33,558 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-02-04 12:07:33,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-04 12:07:33,558 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-02-04 12:07:33,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:33,559 INFO L225 Difference]: With dead ends: 67 [2018-02-04 12:07:33,559 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 12:07:33,559 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-04 12:07:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 12:07:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 58. [2018-02-04 12:07:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-02-04 12:07:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2018-02-04 12:07:33,560 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 32 [2018-02-04 12:07:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:33,560 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2018-02-04 12:07:33,560 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 12:07:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2018-02-04 12:07:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-02-04 12:07:33,561 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:33,561 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-04 12:07:33,561 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1093780658, now seen corresponding path program 1 times [2018-02-04 12:07:33,561 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:33,561 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:33,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:33,561 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:33,561 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:33,567 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:33,692 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-04 12:07:33,692 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:33,692 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:33,697 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:33,710 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:33,729 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-04 12:07:33,745 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 12:07:33,745 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [12] total 15 [2018-02-04 12:07:33,745 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-04 12:07:33,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-04 12:07:33,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-02-04 12:07:33,746 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand 15 states. [2018-02-04 12:07:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:34,105 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-02-04 12:07:34,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-04 12:07:34,106 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-02-04 12:07:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:34,106 INFO L225 Difference]: With dead ends: 80 [2018-02-04 12:07:34,106 INFO L226 Difference]: Without dead ends: 78 [2018-02-04 12:07:34,106 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-04 12:07:34,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-02-04 12:07:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 65. [2018-02-04 12:07:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-02-04 12:07:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-02-04 12:07:34,107 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 32 [2018-02-04 12:07:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:34,108 INFO L432 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-02-04 12:07:34,108 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-04 12:07:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-02-04 12:07:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 12:07:34,108 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:34,108 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-04 12:07:34,108 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:34,108 INFO L82 PathProgramCache]: Analyzing trace with hash -451522982, now seen corresponding path program 2 times [2018-02-04 12:07:34,108 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:34,109 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:34,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:34,109 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:34,109 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:34,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:34,411 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-04 12:07:34,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:34,411 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:34,416 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:07:34,442 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:07:34,442 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:07:34,445 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:34,448 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-04 12:07:34,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:34,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:34,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:07:34,459 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-04 12:07:34,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:34,466 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:34,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:34,468 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-04 12:07:34,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:34,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:34,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 12:07:34,511 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-04 12:07:34,513 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-04 12:07:34,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:34,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:34,519 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-04 12:07:34,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-04 12:07:34,663 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-04 12:07:34,665 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-04 12:07:34,665 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:34,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:34,674 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-04 12:07:34,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-04 12:07:34,726 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-04 12:07:34,731 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-04 12:07:34,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:34,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:34,742 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-04 12:07:34,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-04 12:07:34,781 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-04 12:07:34,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:34,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-02-04 12:07:34,798 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:07:34,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:07:34,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:07:34,799 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 26 states. [2018-02-04 12:07:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:35,625 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-02-04 12:07:35,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 12:07:35,626 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 33 [2018-02-04 12:07:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:35,626 INFO L225 Difference]: With dead ends: 74 [2018-02-04 12:07:35,626 INFO L226 Difference]: Without dead ends: 74 [2018-02-04 12:07:35,627 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=1595, Unknown=0, NotChecked=0, Total=1806 [2018-02-04 12:07:35,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-02-04 12:07:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-02-04 12:07:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-02-04 12:07:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-02-04 12:07:35,629 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 33 [2018-02-04 12:07:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:35,629 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-02-04 12:07:35,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:07:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-02-04 12:07:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 12:07:35,629 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:35,630 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-04 12:07:35,630 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:35,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1502086491, now seen corresponding path program 2 times [2018-02-04 12:07:35,630 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:35,630 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:35,630 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:35,631 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:07:35,631 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:35,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:36,091 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-04 12:07:36,091 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:36,091 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:36,097 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:07:36,111 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:07:36,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:07:36,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:36,116 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-04 12:07:36,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:07:36,137 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-04 12:07:36,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:36,141 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:36,142 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-04 12:07:36,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 12:07:36,175 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-04 12:07:36,177 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-04 12:07:36,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,182 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-04 12:07:36,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-04 12:07:36,253 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-04 12:07:36,255 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-04 12:07:36,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,262 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-04 12:07:36,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:30 [2018-02-04 12:07:36,387 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-04 12:07:36,390 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-04 12:07:36,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:36,395 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-04 12:07:36,396 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:36,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:36,404 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-04 12:07:36,404 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-02-04 12:07:36,441 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-04 12:07:36,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:36,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2018-02-04 12:07:36,459 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-02-04 12:07:36,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-02-04 12:07:36,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=900, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:07:36,459 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 32 states. [2018-02-04 12:07:37,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:37,158 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-02-04 12:07:37,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 12:07:37,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-02-04 12:07:37,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:37,159 INFO L225 Difference]: With dead ends: 72 [2018-02-04 12:07:37,159 INFO L226 Difference]: Without dead ends: 57 [2018-02-04 12:07:37,160 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 12:07:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-02-04 12:07:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-02-04 12:07:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-02-04 12:07:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-02-04 12:07:37,161 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 34 [2018-02-04 12:07:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:37,162 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-02-04 12:07:37,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-02-04 12:07:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-02-04 12:07:37,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-02-04 12:07:37,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:37,162 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-04 12:07:37,162 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:37,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1112310596, now seen corresponding path program 2 times [2018-02-04 12:07:37,163 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:37,163 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:37,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:37,163 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:07:37,163 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:37,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:37,355 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-04 12:07:37,355 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:37,355 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:37,363 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:07:37,390 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:07:37,390 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:07:37,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:37,397 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-04 12:07:37,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:37,402 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-04 12:07:37,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:37,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:37,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:07:37,411 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:37,412 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:37,412 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-04 12:07:37,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:37,419 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-04 12:07:37,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:37,428 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-04 12:07:37,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:07:37,651 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-04 12:07:37,673 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:37,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2018-02-04 12:07:37,673 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-02-04 12:07:37,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-02-04 12:07:37,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-02-04 12:07:37,674 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 21 states. [2018-02-04 12:07:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:38,012 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-02-04 12:07:38,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-02-04 12:07:38,013 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-02-04 12:07:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:38,013 INFO L225 Difference]: With dead ends: 65 [2018-02-04 12:07:38,013 INFO L226 Difference]: Without dead ends: 65 [2018-02-04 12:07:38,013 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-02-04 12:07:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-04 12:07:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-02-04 12:07:38,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 12:07:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-02-04 12:07:38,015 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 34 [2018-02-04 12:07:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:38,015 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-02-04 12:07:38,015 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-02-04 12:07:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2018-02-04 12:07:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-02-04 12:07:38,015 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:38,016 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-04 12:07:38,016 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:38,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1315632508, now seen corresponding path program 1 times [2018-02-04 12:07:38,016 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:38,016 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:38,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:38,017 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:07:38,017 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:38,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:38,387 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-04 12:07:38,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:38,387 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:38,392 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:38,407 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:38,408 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-04 12:07:38,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:07:38,413 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-04 12:07:38,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:38,417 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:38,418 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-04 12:07:38,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 12:07:38,442 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-04 12:07:38,443 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-04 12:07:38,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-02-04 12:07:38,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-04 12:07:38,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-04 12:07:38,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,542 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-04 12:07:38,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-02-04 12:07:38,564 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-04 12:07:38,565 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-04 12:07:38,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,573 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-04 12:07:38,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-02-04 12:07:38,692 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-04 12:07:38,694 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-04 12:07:38,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:38,710 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-04 12:07:38,710 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:38,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:38,718 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-04 12:07:38,718 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-02-04 12:07:38,757 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-04 12:07:38,782 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:38,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-02-04 12:07:38,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 12:07:38,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 12:07:38,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:07:38,783 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 27 states. [2018-02-04 12:07:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:39,592 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-02-04 12:07:39,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 12:07:39,592 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-02-04 12:07:39,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:39,592 INFO L225 Difference]: With dead ends: 64 [2018-02-04 12:07:39,592 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 12:07:39,593 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=247, Invalid=1915, Unknown=0, NotChecked=0, Total=2162 [2018-02-04 12:07:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 12:07:39,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 12:07:39,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 12:07:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-02-04 12:07:39,594 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 36 [2018-02-04 12:07:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:39,595 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-02-04 12:07:39,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 12:07:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-02-04 12:07:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 12:07:39,595 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:39,595 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-04 12:07:39,595 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1099949155, now seen corresponding path program 2 times [2018-02-04 12:07:39,595 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:39,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:39,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:39,596 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 12:07:39,596 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:39,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:39,954 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-04 12:07:39,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:39,955 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:39,963 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-04 12:07:39,989 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-04 12:07:39,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:07:39,992 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:40,003 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-04 12:07:40,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:40,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:40,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-04 12:07:40,018 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:40,019 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:40,019 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-04 12:07:40,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:40,024 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-04 12:07:40,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:40,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:40,029 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-02-04 12:07:40,069 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-04 12:07:40,070 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-04 12:07:40,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:40,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:40,076 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-04 12:07:40,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-02-04 12:07:40,232 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-04 12:07:40,233 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-04 12:07:40,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:40,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:40,241 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-04 12:07:40,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-02-04 12:07:40,304 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-04 12:07:40,308 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-04 12:07:40,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-02-04 12:07:40,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-04 12:07:40,316 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-04 12:07:40,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-02-04 12:07:40,347 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-04 12:07:40,364 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:40,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 25 [2018-02-04 12:07:40,364 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-04 12:07:40,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-04 12:07:40,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-02-04 12:07:40,365 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-02-04 12:07:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:40,973 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-02-04 12:07:40,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 12:07:40,974 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 38 [2018-02-04 12:07:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:40,974 INFO L225 Difference]: With dead ends: 51 [2018-02-04 12:07:40,974 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 12:07:40,975 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-04 12:07:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 12:07:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 12:07:40,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 12:07:40,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-02-04 12:07:40,975 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2018-02-04 12:07:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:40,976 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-02-04 12:07:40,976 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-02-04 12:07:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-02-04 12:07:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-02-04 12:07:40,976 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 12:07:40,976 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-04 12:07:40,976 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-02-04 12:07:40,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1971477742, now seen corresponding path program 3 times [2018-02-04 12:07:40,976 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 12:07:40,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 12:07:40,977 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:40,977 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-04 12:07:40,977 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 12:07:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 12:07:40,986 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 12:07:41,194 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-04 12:07:41,194 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 12:07:41,195 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 12:07:41,203 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-04 12:07:41,250 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-02-04 12:07:41,251 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-04 12:07:41,255 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 12:07:41,259 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-04 12:07:41,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:41,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-04 12:07:41,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:41,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 12:07:41,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-02-04 12:07:41,277 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:41,278 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-04 12:07:41,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:41,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:41,295 INFO L700 Elim1Store]: detected not equals via solver [2018-02-04 12:07:41,296 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-04 12:07:41,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-04 12:07:41,301 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-04 12:07:41,301 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-02-04 12:07:41,587 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-04 12:07:41,613 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 12:07:41,613 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2018-02-04 12:07:41,613 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-04 12:07:41,613 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-04 12:07:41,613 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2018-02-04 12:07:41,614 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 27 states. [2018-02-04 12:07:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 12:07:42,628 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-02-04 12:07:42,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-02-04 12:07:42,628 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-02-04 12:07:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 12:07:42,628 INFO L225 Difference]: With dead ends: 53 [2018-02-04 12:07:42,628 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 12:07:42,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=2003, Unknown=0, NotChecked=0, Total=2256 [2018-02-04 12:07:42,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 12:07:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 12:07:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 12:07:42,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 12:07:42,629 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2018-02-04 12:07:42,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 12:07:42,629 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 12:07:42,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-04 12:07:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 12:07:42,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 12:07:42,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:07:42 BoogieIcfgContainer [2018-02-04 12:07:42,633 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 12:07:42,634 INFO L168 Benchmark]: Toolchain (without parser) took 20137.05 ms. Allocated memory was 397.4 MB in the beginning and 827.9 MB in the end (delta: 430.4 MB). Free memory was 354.3 MB in the beginning and 495.3 MB in the end (delta: -141.0 MB). Peak memory consumption was 289.5 MB. Max. memory is 5.3 GB. [2018-02-04 12:07:42,635 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 397.4 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 12:07:42,635 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.49 ms. Allocated memory is still 397.4 MB. Free memory was 354.3 MB in the beginning and 343.7 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:07:42,635 INFO L168 Benchmark]: Boogie Preprocessor took 27.31 ms. Allocated memory is still 397.4 MB. Free memory was 343.7 MB in the beginning and 341.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 12:07:42,635 INFO L168 Benchmark]: RCFGBuilder took 218.40 ms. Allocated memory is still 397.4 MB. Free memory was 341.1 MB in the beginning and 321.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. [2018-02-04 12:07:42,636 INFO L168 Benchmark]: TraceAbstraction took 19741.25 ms. Allocated memory was 397.4 MB in the beginning and 827.9 MB in the end (delta: 430.4 MB). Free memory was 321.7 MB in the beginning and 495.3 MB in the end (delta: -173.5 MB). Peak memory consumption was 256.9 MB. Max. memory is 5.3 GB. [2018-02-04 12:07:42,637 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.13 ms. Allocated memory is still 397.4 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 147.49 ms. Allocated memory is still 397.4 MB. Free memory was 354.3 MB in the beginning and 343.7 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.31 ms. Allocated memory is still 397.4 MB. Free memory was 343.7 MB in the beginning and 341.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 218.40 ms. Allocated memory is still 397.4 MB. Free memory was 341.1 MB in the beginning and 321.7 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 19741.25 ms. Allocated memory was 397.4 MB in the beginning and 827.9 MB in the end (delta: 430.4 MB). Free memory was 321.7 MB in the beginning and 495.3 MB in the end (delta: -173.5 MB). Peak memory consumption was 256.9 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, 19.7s OverallTime, 31 OverallIterations, 4 TraceHistogramMax, 11.6s 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.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 862 GetRequests, 290 SyntacticMatches, 17 SemanticMatches, 555 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2849 ImplicationChecksByTransitivity, 9.4s 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, 6.8s 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-04_12-07-42-642.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-04_12-07-42-642.csv Received shutdown request...