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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:10:34,458 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:10:34,460 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:10:34,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:10:34,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:10:34,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:10:34,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:10:34,475 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:10:34,478 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:10:34,478 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:10:34,479 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:10:34,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:10:34,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:10:34,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:10:34,482 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:10:34,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:10:34,486 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:10:34,488 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:10:34,490 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:10:34,491 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:10:34,493 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:10:34,493 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:10:34,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:10:34,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:10:34,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:10:34,497 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:10:34,497 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:10:34,498 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:10:34,498 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:10:34,498 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:10:34,499 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:10:34,499 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:10:34,509 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:10:34,509 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:10:34,510 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:10:34,510 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:10:34,510 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:10:34,511 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:10:34,511 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:10:34,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:10:34,512 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:10:34,512 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:10:34,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:10:34,512 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:10:34,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:10:34,513 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:10:34,513 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:10:34,513 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:10:34,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:10:34,513 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:10:34,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:10:34,514 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:10:34,514 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:10:34,514 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:10:34,514 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:10:34,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:10:34,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:10:34,515 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:10:34,515 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:10:34,515 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:10:34,515 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:10:34,516 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:10:34,516 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:10:34,516 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:10:34,517 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:10:34,517 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:10:34,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:10:34,565 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:10:34,570 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:10:34,571 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:10:34,572 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:10:34,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:10:34,770 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:10:34,777 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:10:34,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:10:34,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:10:34,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:10:34,786 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:10:34" (1/1) ... [2018-01-28 21:10:34,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21e00d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34, skipping insertion in model container [2018-01-28 21:10:34,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:10:34" (1/1) ... [2018-01-28 21:10:34,810 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:10:34,853 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:10:34,975 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:10:34,993 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:10:34,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34 WrapperNode [2018-01-28 21:10:34,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:10:35,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:10:35,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:10:35,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:10:35,013 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34" (1/1) ... [2018-01-28 21:10:35,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34" (1/1) ... [2018-01-28 21:10:35,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34" (1/1) ... [2018-01-28 21:10:35,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34" (1/1) ... [2018-01-28 21:10:35,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34" (1/1) ... [2018-01-28 21:10:35,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34" (1/1) ... [2018-01-28 21:10:35,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34" (1/1) ... [2018-01-28 21:10:35,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:10:35,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:10:35,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:10:35,038 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:10:35,038 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34" (1/1) ... No working directory specified, using /storage/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-01-28 21:10:35,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:10:35,087 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:10:35,087 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrlcpy [2018-01-28 21:10:35,088 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:10:35,088 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-28 21:10:35,088 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-28 21:10:35,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:10:35,088 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:10:35,088 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:10:35,088 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-28 21:10:35,089 INFO L128 BoogieDeclarations]: Found specification of procedure cstrlcpy [2018-01-28 21:10:35,089 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:10:35,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:10:35,089 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:10:35,375 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:10:35,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:10:35 BoogieIcfgContainer [2018-01-28 21:10:35,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:10:35,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:10:35,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:10:35,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:10:35,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:10:34" (1/3) ... [2018-01-28 21:10:35,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3f3ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:10:35, skipping insertion in model container [2018-01-28 21:10:35,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:10:34" (2/3) ... [2018-01-28 21:10:35,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3f3ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:10:35, skipping insertion in model container [2018-01-28 21:10:35,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:10:35" (3/3) ... [2018-01-28 21:10:35,382 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-01-28 21:10:35,388 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:10:35,396 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-28 21:10:35,444 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:10:35,444 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:10:35,444 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:10:35,444 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:10:35,444 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:10:35,445 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:10:35,445 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:10:35,445 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:10:35,446 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:10:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-01-28 21:10:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:10:35,474 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:35,476 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:35,476 INFO L371 AbstractCegarLoop]: === Iteration 1 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash 190942389, now seen corresponding path program 1 times [2018-01-28 21:10:35,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:35,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:35,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:35,536 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:35,536 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:35,606 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:35,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:35,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:10:35,823 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:10:35,839 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:10:35,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:10:35,843 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2018-01-28 21:10:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:36,024 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-01-28 21:10:36,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:10:36,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-28 21:10:36,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:36,036 INFO L225 Difference]: With dead ends: 117 [2018-01-28 21:10:36,036 INFO L226 Difference]: Without dead ends: 83 [2018-01-28 21:10:36,040 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:10:36,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-01-28 21:10:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-01-28 21:10:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-01-28 21:10:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-01-28 21:10:36,079 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 19 [2018-01-28 21:10:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:36,080 INFO L432 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-01-28 21:10:36,080 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:10:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-01-28 21:10:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-28 21:10:36,081 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:36,081 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:36,081 INFO L371 AbstractCegarLoop]: === Iteration 2 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash 190942390, now seen corresponding path program 1 times [2018-01-28 21:10:36,082 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:36,082 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:36,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:36,083 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:36,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:36,261 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:36,261 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:10:36,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:10:36,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:10:36,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:10:36,264 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2018-01-28 21:10:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:36,343 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-28 21:10:36,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:10:36,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-01-28 21:10:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:36,345 INFO L225 Difference]: With dead ends: 83 [2018-01-28 21:10:36,345 INFO L226 Difference]: Without dead ends: 82 [2018-01-28 21:10:36,346 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:10:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-28 21:10:36,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-28 21:10:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-28 21:10:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-01-28 21:10:36,356 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 19 [2018-01-28 21:10:36,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:36,356 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-01-28 21:10:36,356 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:10:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-01-28 21:10:36,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:10:36,357 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:36,357 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:36,357 INFO L371 AbstractCegarLoop]: === Iteration 3 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1624246854, now seen corresponding path program 1 times [2018-01-28 21:10:36,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:36,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:36,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:36,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:36,375 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:36,414 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:36,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:10:36,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-28 21:10:36,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-28 21:10:36,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-28 21:10:36,416 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 4 states. [2018-01-28 21:10:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:36,472 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-01-28 21:10:36,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-28 21:10:36,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-28 21:10:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:36,474 INFO L225 Difference]: With dead ends: 82 [2018-01-28 21:10:36,474 INFO L226 Difference]: Without dead ends: 81 [2018-01-28 21:10:36,475 INFO L533 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-01-28 21:10:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-28 21:10:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-01-28 21:10:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-01-28 21:10:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-01-28 21:10:36,483 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 20 [2018-01-28 21:10:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:36,484 INFO L432 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-01-28 21:10:36,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-28 21:10:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-01-28 21:10:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-28 21:10:36,485 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:36,485 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:36,485 INFO L371 AbstractCegarLoop]: === Iteration 4 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:36,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1624246855, now seen corresponding path program 1 times [2018-01-28 21:10:36,485 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:36,486 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:36,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,487 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:36,487 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:36,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:36,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:36,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:10:36,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:10:36,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:10:36,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:10:36,592 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 5 states. [2018-01-28 21:10:36,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:36,647 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-01-28 21:10:36,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:10:36,648 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-28 21:10:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:36,649 INFO L225 Difference]: With dead ends: 81 [2018-01-28 21:10:36,649 INFO L226 Difference]: Without dead ends: 80 [2018-01-28 21:10:36,650 INFO L533 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-01-28 21:10:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-01-28 21:10:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-01-28 21:10:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-28 21:10:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-01-28 21:10:36,657 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 20 [2018-01-28 21:10:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:36,658 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-01-28 21:10:36,658 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:10:36,658 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-01-28 21:10:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 21:10:36,659 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:36,659 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:36,659 INFO L371 AbstractCegarLoop]: === Iteration 5 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1194008499, now seen corresponding path program 1 times [2018-01-28 21:10:36,660 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:36,660 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:36,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,661 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:36,661 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:36,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:36,762 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:36,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:10:36,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:10:36,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:10:36,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:10:36,763 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-01-28 21:10:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:36,899 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-01-28 21:10:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-28 21:10:36,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-28 21:10:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:36,905 INFO L225 Difference]: With dead ends: 107 [2018-01-28 21:10:36,905 INFO L226 Difference]: Without dead ends: 106 [2018-01-28 21:10:36,906 INFO L533 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-01-28 21:10:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-28 21:10:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2018-01-28 21:10:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 21:10:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-01-28 21:10:36,916 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 31 [2018-01-28 21:10:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:36,917 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-01-28 21:10:36,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:10:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-01-28 21:10:36,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-28 21:10:36,918 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:36,918 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:36,918 INFO L371 AbstractCegarLoop]: === Iteration 6 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:36,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1194008498, now seen corresponding path program 1 times [2018-01-28 21:10:36,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:36,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:36,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:36,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:36,938 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:37,081 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:37,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:10:37,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-28 21:10:37,082 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-28 21:10:37,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:10:37,083 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 9 states. [2018-01-28 21:10:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:37,279 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2018-01-28 21:10:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:10:37,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-01-28 21:10:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:37,282 INFO L225 Difference]: With dead ends: 106 [2018-01-28 21:10:37,282 INFO L226 Difference]: Without dead ends: 105 [2018-01-28 21:10:37,282 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-01-28 21:10:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-28 21:10:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2018-01-28 21:10:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 21:10:37,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2018-01-28 21:10:37,291 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 31 [2018-01-28 21:10:37,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:37,292 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2018-01-28 21:10:37,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-28 21:10:37,292 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2018-01-28 21:10:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 21:10:37,293 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:37,293 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:37,293 INFO L371 AbstractCegarLoop]: === Iteration 7 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash 216843477, now seen corresponding path program 1 times [2018-01-28 21:10:37,294 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:37,294 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:37,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:37,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:37,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:37,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:37,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:37,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:37,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:10:37,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:10:37,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:10:37,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:10:37,431 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 7 states. [2018-01-28 21:10:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:37,570 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-01-28 21:10:37,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:10:37,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-28 21:10:37,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:37,571 INFO L225 Difference]: With dead ends: 107 [2018-01-28 21:10:37,571 INFO L226 Difference]: Without dead ends: 106 [2018-01-28 21:10:37,571 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:10:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-01-28 21:10:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-01-28 21:10:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-28 21:10:37,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2018-01-28 21:10:37,580 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 34 [2018-01-28 21:10:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:37,580 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2018-01-28 21:10:37,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:10:37,581 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2018-01-28 21:10:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-28 21:10:37,582 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:37,582 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:37,582 INFO L371 AbstractCegarLoop]: === Iteration 8 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:37,582 INFO L82 PathProgramCache]: Analyzing trace with hash 216843478, now seen corresponding path program 1 times [2018-01-28 21:10:37,582 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:37,583 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:37,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:37,584 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:37,584 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:37,596 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:37,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:37,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:37,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:10:37,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:10:37,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:10:37,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:10:37,740 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand 10 states. [2018-01-28 21:10:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:37,920 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-01-28 21:10:37,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:10:37,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-01-28 21:10:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:37,922 INFO L225 Difference]: With dead ends: 111 [2018-01-28 21:10:37,922 INFO L226 Difference]: Without dead ends: 110 [2018-01-28 21:10:37,922 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:10:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-01-28 21:10:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2018-01-28 21:10:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-01-28 21:10:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2018-01-28 21:10:37,929 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 34 [2018-01-28 21:10:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:37,930 INFO L432 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2018-01-28 21:10:37,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:10:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2018-01-28 21:10:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:10:37,931 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:37,931 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:37,932 INFO L371 AbstractCegarLoop]: === Iteration 9 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash -79052563, now seen corresponding path program 1 times [2018-01-28 21:10:37,932 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:37,932 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:37,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:37,933 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:37,933 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:37,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:38,086 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:38,086 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:10:38,086 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:10:38,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:10:38,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:10:38,087 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 7 states. [2018-01-28 21:10:38,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:38,168 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2018-01-28 21:10:38,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:10:38,168 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-01-28 21:10:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:38,169 INFO L225 Difference]: With dead ends: 105 [2018-01-28 21:10:38,169 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 21:10:38,170 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:10:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 21:10:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2018-01-28 21:10:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 21:10:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2018-01-28 21:10:38,175 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 38 [2018-01-28 21:10:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:38,175 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2018-01-28 21:10:38,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:10:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2018-01-28 21:10:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-28 21:10:38,176 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:38,177 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:38,177 INFO L371 AbstractCegarLoop]: === Iteration 10 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:38,177 INFO L82 PathProgramCache]: Analyzing trace with hash -79052562, now seen corresponding path program 1 times [2018-01-28 21:10:38,177 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:38,177 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:38,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:38,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:38,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:38,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:38,306 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:38,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:10:38,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:10:38,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:10:38,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:10:38,308 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 10 states. [2018-01-28 21:10:38,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:38,449 INFO L93 Difference]: Finished difference Result 116 states and 129 transitions. [2018-01-28 21:10:38,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:10:38,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-01-28 21:10:38,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:38,451 INFO L225 Difference]: With dead ends: 116 [2018-01-28 21:10:38,451 INFO L226 Difference]: Without dead ends: 115 [2018-01-28 21:10:38,452 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:10:38,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-28 21:10:38,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2018-01-28 21:10:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-28 21:10:38,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-01-28 21:10:38,458 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 38 [2018-01-28 21:10:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:38,458 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-01-28 21:10:38,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:10:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-01-28 21:10:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 21:10:38,459 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:38,459 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:38,459 INFO L371 AbstractCegarLoop]: === Iteration 11 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:38,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1645468291, now seen corresponding path program 1 times [2018-01-28 21:10:38,459 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:38,459 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:38,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:38,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:38,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:38,472 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:38,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:38,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:38,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-28 21:10:38,500 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-28 21:10:38,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-28 21:10:38,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:10:38,501 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 3 states. [2018-01-28 21:10:38,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:38,527 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2018-01-28 21:10:38,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-28 21:10:38,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-01-28 21:10:38,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:38,529 INFO L225 Difference]: With dead ends: 119 [2018-01-28 21:10:38,529 INFO L226 Difference]: Without dead ends: 108 [2018-01-28 21:10:38,529 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-28 21:10:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-28 21:10:38,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2018-01-28 21:10:38,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-28 21:10:38,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-01-28 21:10:38,536 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 39 [2018-01-28 21:10:38,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:38,536 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-01-28 21:10:38,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-28 21:10:38,537 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-01-28 21:10:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 21:10:38,538 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:38,538 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:38,538 INFO L371 AbstractCegarLoop]: === Iteration 12 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:38,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1844337844, now seen corresponding path program 1 times [2018-01-28 21:10:38,539 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:38,539 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:38,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:38,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:38,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:38,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:38,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:38,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-28 21:10:38,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-28 21:10:38,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-28 21:10:38,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:10:38,761 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 10 states. [2018-01-28 21:10:39,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:39,185 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-01-28 21:10:39,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-28 21:10:39,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-01-28 21:10:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:39,205 INFO L225 Difference]: With dead ends: 117 [2018-01-28 21:10:39,205 INFO L226 Difference]: Without dead ends: 116 [2018-01-28 21:10:39,205 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:10:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-01-28 21:10:39,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2018-01-28 21:10:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-28 21:10:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2018-01-28 21:10:39,209 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 39 [2018-01-28 21:10:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:39,209 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2018-01-28 21:10:39,209 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-28 21:10:39,209 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2018-01-28 21:10:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-28 21:10:39,210 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:39,210 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:39,210 INFO L371 AbstractCegarLoop]: === Iteration 13 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:39,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1844337843, now seen corresponding path program 1 times [2018-01-28 21:10:39,210 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:39,210 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:39,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:39,211 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:39,211 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:39,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:39,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:39,280 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-28 21:10:39,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:10:39,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:10:39,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:10:39,280 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 7 states. [2018-01-28 21:10:39,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:39,416 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2018-01-28 21:10:39,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-28 21:10:39,416 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-01-28 21:10:39,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:39,417 INFO L225 Difference]: With dead ends: 106 [2018-01-28 21:10:39,418 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 21:10:39,418 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-01-28 21:10:39,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 21:10:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-28 21:10:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-28 21:10:39,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-01-28 21:10:39,424 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 39 [2018-01-28 21:10:39,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:39,424 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-01-28 21:10:39,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:10:39,425 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-01-28 21:10:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-28 21:10:39,425 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:39,426 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:39,426 INFO L371 AbstractCegarLoop]: === Iteration 14 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:39,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1321660321, now seen corresponding path program 1 times [2018-01-28 21:10:39,426 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:39,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:39,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:39,427 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:39,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:39,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-28 21:10:39,551 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:39,551 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:10:39,551 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-28 21:10:39,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-28 21:10:39,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:10:39,552 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 7 states. [2018-01-28 21:10:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:39,638 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2018-01-28 21:10:39,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:10:39,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-01-28 21:10:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:39,640 INFO L225 Difference]: With dead ends: 137 [2018-01-28 21:10:39,640 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 21:10:39,641 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-01-28 21:10:39,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 21:10:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-01-28 21:10:39,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-28 21:10:39,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2018-01-28 21:10:39,648 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 41 [2018-01-28 21:10:39,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:39,648 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2018-01-28 21:10:39,648 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-28 21:10:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2018-01-28 21:10:39,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-28 21:10:39,649 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:39,649 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:39,649 INFO L371 AbstractCegarLoop]: === Iteration 15 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash 12727972, now seen corresponding path program 1 times [2018-01-28 21:10:39,650 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:39,650 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:39,650 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:39,650 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:39,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:39,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-28 21:10:39,807 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:39,807 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-28 21:10:39,807 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:10:39,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:10:39,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:10:39,808 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 8 states. [2018-01-28 21:10:39,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:39,878 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2018-01-28 21:10:39,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-28 21:10:39,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-28 21:10:39,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:39,880 INFO L225 Difference]: With dead ends: 131 [2018-01-28 21:10:39,880 INFO L226 Difference]: Without dead ends: 103 [2018-01-28 21:10:39,880 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:10:39,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-28 21:10:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-01-28 21:10:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-01-28 21:10:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2018-01-28 21:10:39,886 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 42 [2018-01-28 21:10:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:39,887 INFO L432 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2018-01-28 21:10:39,887 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:10:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2018-01-28 21:10:39,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-28 21:10:39,888 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:39,888 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:39,888 INFO L371 AbstractCegarLoop]: === Iteration 16 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:39,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1280833471, now seen corresponding path program 1 times [2018-01-28 21:10:39,888 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:39,888 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:39,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:39,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:39,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:39,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:40,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:40,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:10:40,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:10:40,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:10:40,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:10:40,037 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand 6 states. [2018-01-28 21:10:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:40,233 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2018-01-28 21:10:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:10:40,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-01-28 21:10:40,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:40,235 INFO L225 Difference]: With dead ends: 103 [2018-01-28 21:10:40,235 INFO L226 Difference]: Without dead ends: 90 [2018-01-28 21:10:40,235 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:10:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-28 21:10:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-01-28 21:10:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-28 21:10:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2018-01-28 21:10:40,241 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 44 [2018-01-28 21:10:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:40,241 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2018-01-28 21:10:40,241 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:10:40,241 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-01-28 21:10:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-28 21:10:40,242 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:40,242 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:40,242 INFO L371 AbstractCegarLoop]: === Iteration 17 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1275551011, now seen corresponding path program 1 times [2018-01-28 21:10:40,243 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:40,243 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:40,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:40,244 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:40,244 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:40,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:40,515 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:40,515 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-28 21:10:40,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-28 21:10:40,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-28 21:10:40,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:10:40,516 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand 16 states. [2018-01-28 21:10:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:40,919 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-01-28 21:10:40,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:10:40,919 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2018-01-28 21:10:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:40,920 INFO L225 Difference]: With dead ends: 119 [2018-01-28 21:10:40,920 INFO L226 Difference]: Without dead ends: 118 [2018-01-28 21:10:40,920 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2018-01-28 21:10:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-28 21:10:40,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 105. [2018-01-28 21:10:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-01-28 21:10:40,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 113 transitions. [2018-01-28 21:10:40,926 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 113 transitions. Word has length 46 [2018-01-28 21:10:40,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:40,927 INFO L432 AbstractCegarLoop]: Abstraction has 105 states and 113 transitions. [2018-01-28 21:10:40,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-28 21:10:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 113 transitions. [2018-01-28 21:10:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-28 21:10:40,928 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:40,928 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:40,928 INFO L371 AbstractCegarLoop]: === Iteration 18 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:40,928 INFO L82 PathProgramCache]: Analyzing trace with hash -850903064, now seen corresponding path program 1 times [2018-01-28 21:10:40,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:40,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:40,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:40,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:40,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:40,942 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:41,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:41,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:10:41,259 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:10:41,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:41,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:10:41,350 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-01-28 21:10:41,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:41,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:41,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:10:41,372 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:10:41,373 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:10:41,375 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-01-28 21:10:41,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:41,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:41,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-01-28 21:10:41,469 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-01-28 21:10:41,471 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-01-28 21:10:41,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:41,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:41,478 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-01-28 21:10:41,479 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-01-28 21:10:41,798 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-01-28 21:10:41,806 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-01-28 21:10:41,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:41,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:41,842 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-01-28 21:10:41,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-01-28 21:10:42,056 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-01-28 21:10:42,059 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-01-28 21:10:42,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:42,070 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-01-28 21:10:42,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:10:42,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:42,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:42,089 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:49, output treesize:29 [2018-01-28 21:10:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:42,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:10:42,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2018-01-28 21:10:42,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-28 21:10:42,179 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-28 21:10:42,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=858, Unknown=0, NotChecked=0, Total=930 [2018-01-28 21:10:42,180 INFO L87 Difference]: Start difference. First operand 105 states and 113 transitions. Second operand 31 states. [2018-01-28 21:10:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:44,298 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2018-01-28 21:10:44,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-01-28 21:10:44,315 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 47 [2018-01-28 21:10:44,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:44,316 INFO L225 Difference]: With dead ends: 116 [2018-01-28 21:10:44,316 INFO L226 Difference]: Without dead ends: 115 [2018-01-28 21:10:44,317 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=335, Invalid=2017, Unknown=0, NotChecked=0, Total=2352 [2018-01-28 21:10:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-28 21:10:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-01-28 21:10:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-28 21:10:44,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2018-01-28 21:10:44,324 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 47 [2018-01-28 21:10:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:44,325 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2018-01-28 21:10:44,325 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-28 21:10:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2018-01-28 21:10:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:10:44,326 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:44,326 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:44,326 INFO L371 AbstractCegarLoop]: === Iteration 19 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash 285211781, now seen corresponding path program 1 times [2018-01-28 21:10:44,326 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:44,326 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:44,327 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:44,327 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:44,328 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:44,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:44,423 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:44,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-28 21:10:44,424 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-28 21:10:44,424 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-28 21:10:44,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-28 21:10:44,424 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 8 states. [2018-01-28 21:10:44,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:44,526 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2018-01-28 21:10:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-28 21:10:44,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-01-28 21:10:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:44,527 INFO L225 Difference]: With dead ends: 112 [2018-01-28 21:10:44,527 INFO L226 Difference]: Without dead ends: 111 [2018-01-28 21:10:44,528 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-01-28 21:10:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-01-28 21:10:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 104. [2018-01-28 21:10:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-01-28 21:10:44,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-01-28 21:10:44,535 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 50 [2018-01-28 21:10:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:44,535 INFO L432 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-01-28 21:10:44,535 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-28 21:10:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-01-28 21:10:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-28 21:10:44,536 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:44,536 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:44,536 INFO L371 AbstractCegarLoop]: === Iteration 20 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:44,537 INFO L82 PathProgramCache]: Analyzing trace with hash 285211782, now seen corresponding path program 1 times [2018-01-28 21:10:44,537 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:44,537 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:44,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:44,538 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:44,538 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:44,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:44,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:44,875 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:10:44,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-28 21:10:44,875 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 21:10:44,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 21:10:44,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:10:44,876 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 17 states. [2018-01-28 21:10:45,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:45,245 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2018-01-28 21:10:45,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:10:45,245 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2018-01-28 21:10:45,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:45,246 INFO L225 Difference]: With dead ends: 123 [2018-01-28 21:10:45,246 INFO L226 Difference]: Without dead ends: 109 [2018-01-28 21:10:45,246 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2018-01-28 21:10:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-28 21:10:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-01-28 21:10:45,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-28 21:10:45,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-28 21:10:45,251 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 50 [2018-01-28 21:10:45,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:45,251 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-28 21:10:45,251 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 21:10:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-28 21:10:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-28 21:10:45,252 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:45,252 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:45,252 INFO L371 AbstractCegarLoop]: === Iteration 21 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1333931551, now seen corresponding path program 1 times [2018-01-28 21:10:45,252 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:45,252 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:45,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:45,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:45,253 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:45,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:45,620 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:10:45,621 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:10:45,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:45,661 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:10:45,672 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-01-28 21:10:45,674 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-01-28 21:10:45,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:45,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:45,691 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-01-28 21:10:45,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 21:10:45,923 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-01-28 21:10:45,929 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-01-28 21:10:45,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:10:45,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:45,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:45,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-28 21:10:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:46,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:10:46,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-28 21:10:46,011 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 21:10:46,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 21:10:46,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-28 21:10:46,011 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 21 states. [2018-01-28 21:10:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:46,749 INFO L93 Difference]: Finished difference Result 126 states and 133 transitions. [2018-01-28 21:10:46,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:10:46,750 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-01-28 21:10:46,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:46,750 INFO L225 Difference]: With dead ends: 126 [2018-01-28 21:10:46,750 INFO L226 Difference]: Without dead ends: 125 [2018-01-28 21:10:46,751 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2018-01-28 21:10:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-28 21:10:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2018-01-28 21:10:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-28 21:10:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-01-28 21:10:46,757 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 53 [2018-01-28 21:10:46,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:46,757 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-01-28 21:10:46,757 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 21:10:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-01-28 21:10:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 21:10:46,758 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:46,758 INFO L330 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:46,759 INFO L371 AbstractCegarLoop]: === Iteration 22 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1659002125, now seen corresponding path program 2 times [2018-01-28 21:10:46,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:46,759 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:46,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:46,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:46,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:46,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:47,418 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:10:47,418 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:10:47,427 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:10:47,442 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:10:47,454 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:10:47,457 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:10:47,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:10:47,466 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-01-28 21:10:47,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:47,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:47,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:10:47,475 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-01-28 21:10:47,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:47,482 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:10:47,483 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:10:47,484 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-01-28 21:10:47,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:47,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:47,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 21:10:47,540 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-01-28 21:10:47,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-01-28 21:10:47,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:47,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:47,555 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-01-28 21:10:47,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 21:10:47,740 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-01-28 21:10:47,749 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-01-28 21:10:47,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:47,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:47,764 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-01-28 21:10:47,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:30 [2018-01-28 21:10:48,057 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-01-28 21:10:48,060 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-01-28 21:10:48,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:48,070 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-01-28 21:10:48,070 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-28 21:10:48,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:48,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:48,082 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-01-28 21:10:48,153 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:48,173 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:10:48,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 35 [2018-01-28 21:10:48,174 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-28 21:10:48,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-28 21:10:48,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1175, Unknown=0, NotChecked=0, Total=1260 [2018-01-28 21:10:48,174 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 36 states. [2018-01-28 21:10:49,689 WARN L146 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 102 DAG size of output 73 [2018-01-28 21:10:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:50,374 INFO L93 Difference]: Finished difference Result 117 states and 123 transitions. [2018-01-28 21:10:50,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 21:10:50,374 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 54 [2018-01-28 21:10:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:50,375 INFO L225 Difference]: With dead ends: 117 [2018-01-28 21:10:50,375 INFO L226 Difference]: Without dead ends: 92 [2018-01-28 21:10:50,376 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=486, Invalid=2936, Unknown=0, NotChecked=0, Total=3422 [2018-01-28 21:10:50,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-28 21:10:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-01-28 21:10:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-28 21:10:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2018-01-28 21:10:50,383 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 54 [2018-01-28 21:10:50,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:50,383 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-01-28 21:10:50,383 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-28 21:10:50,383 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-01-28 21:10:50,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-28 21:10:50,384 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:50,384 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:50,384 INFO L371 AbstractCegarLoop]: === Iteration 23 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:50,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1597794849, now seen corresponding path program 1 times [2018-01-28 21:10:50,384 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:50,384 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:50,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:50,385 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:10:50,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:50,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:50,666 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:10:50,667 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:10:50,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:50,695 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:10:50,699 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-01-28 21:10:50,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:50,705 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-01-28 21:10:50,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:50,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:50,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:10:50,757 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:10:50,759 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-01-28 21:10:50,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:50,768 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:10:50,769 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:10:50,770 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-01-28 21:10:50,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:50,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:50,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:10:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:51,069 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:10:51,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-01-28 21:10:51,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-28 21:10:51,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-28 21:10:51,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=916, Unknown=0, NotChecked=0, Total=992 [2018-01-28 21:10:51,071 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 32 states. [2018-01-28 21:10:51,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:51,991 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-01-28 21:10:51,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-28 21:10:51,991 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 54 [2018-01-28 21:10:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:51,992 INFO L225 Difference]: With dead ends: 105 [2018-01-28 21:10:51,992 INFO L226 Difference]: Without dead ends: 104 [2018-01-28 21:10:51,993 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=298, Invalid=1958, Unknown=0, NotChecked=0, Total=2256 [2018-01-28 21:10:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-01-28 21:10:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2018-01-28 21:10:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-28 21:10:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-01-28 21:10:52,000 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 54 [2018-01-28 21:10:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:52,000 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-01-28 21:10:52,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-28 21:10:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2018-01-28 21:10:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-28 21:10:52,001 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:52,001 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:52,001 INFO L371 AbstractCegarLoop]: === Iteration 24 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:52,001 INFO L82 PathProgramCache]: Analyzing trace with hash -928928352, now seen corresponding path program 1 times [2018-01-28 21:10:52,001 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:52,002 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:52,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:52,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:52,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:52,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:52,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:10:52,211 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:10:52,215 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:52,235 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:10:52,240 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-01-28 21:10:52,242 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-01-28 21:10:52,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:52,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:52,248 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-01-28 21:10:52,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-01-28 21:10:52,388 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-01-28 21:10:52,393 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-01-28 21:10:52,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:10:52,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:52,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:52,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-01-28 21:10:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:52,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:10:52,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2018-01-28 21:10:52,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-28 21:10:52,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-28 21:10:52,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-01-28 21:10:52,474 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand 21 states. [2018-01-28 21:10:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:53,053 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-01-28 21:10:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-28 21:10:53,054 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-01-28 21:10:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:53,054 INFO L225 Difference]: With dead ends: 100 [2018-01-28 21:10:53,054 INFO L226 Difference]: Without dead ends: 99 [2018-01-28 21:10:53,055 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=852, Unknown=0, NotChecked=0, Total=992 [2018-01-28 21:10:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-28 21:10:53,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-01-28 21:10:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-28 21:10:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2018-01-28 21:10:53,059 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 55 [2018-01-28 21:10:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:53,059 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2018-01-28 21:10:53,059 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-28 21:10:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-01-28 21:10:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-28 21:10:53,060 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:53,060 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:53,060 INFO L371 AbstractCegarLoop]: === Iteration 25 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1860121834, now seen corresponding path program 1 times [2018-01-28 21:10:53,061 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:53,061 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:53,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:53,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:53,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:53,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:53,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:53,387 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:10:53,387 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:10:53,394 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:53,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:10:53,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-28 21:10:53,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-28 21:10:53,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2018-01-28 21:10:53,503 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-28 21:10:53,503 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-28 21:10:53,503 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-01-28 21:10:53,503 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand 22 states. [2018-01-28 21:10:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:55,004 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2018-01-28 21:10:55,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-28 21:10:55,038 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-01-28 21:10:55,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:55,038 INFO L225 Difference]: With dead ends: 136 [2018-01-28 21:10:55,038 INFO L226 Difference]: Without dead ends: 117 [2018-01-28 21:10:55,039 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=423, Invalid=2229, Unknown=0, NotChecked=0, Total=2652 [2018-01-28 21:10:55,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-01-28 21:10:55,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2018-01-28 21:10:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-01-28 21:10:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2018-01-28 21:10:55,044 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 61 [2018-01-28 21:10:55,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:55,044 INFO L432 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2018-01-28 21:10:55,044 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-28 21:10:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2018-01-28 21:10:55,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-28 21:10:55,045 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:55,045 INFO L330 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:55,045 INFO L371 AbstractCegarLoop]: === Iteration 26 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:55,045 INFO L82 PathProgramCache]: Analyzing trace with hash 727486549, now seen corresponding path program 1 times [2018-01-28 21:10:55,045 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:55,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:55,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:55,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:55,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:55,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:55,767 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:10:55,767 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:10:55,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:55,795 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:10:55,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-28 21:10:55,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:55,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:55,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:10:55,803 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-01-28 21:10:55,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:55,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:10:55,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:10:55,809 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-01-28 21:10:55,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:55,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:55,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 21:10:55,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-28 21:10:55,841 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-01-28 21:10:55,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:55,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:55,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:55,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-01-28 21:10:56,143 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-01-28 21:10:56,145 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-01-28 21:10:56,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:56,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:56,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:56,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-01-28 21:10:56,192 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-01-28 21:10:56,195 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-01-28 21:10:56,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:56,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:10:56,204 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-01-28 21:10:56,204 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-01-28 21:10:56,358 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-01-28 21:10:56,402 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-01-28 21:10:56,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:10:56,441 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-01-28 21:10:56,441 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-28 21:10:56,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:56,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:10:56,513 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-01-28 21:10:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:10:56,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:10:56,625 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 40 [2018-01-28 21:10:56,625 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-28 21:10:56,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-28 21:10:56,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-01-28 21:10:56,626 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand 41 states. [2018-01-28 21:10:58,409 WARN L146 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 80 DAG size of output 54 [2018-01-28 21:10:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:10:59,456 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2018-01-28 21:10:59,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-28 21:10:59,456 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 62 [2018-01-28 21:10:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:10:59,457 INFO L225 Difference]: With dead ends: 114 [2018-01-28 21:10:59,457 INFO L226 Difference]: Without dead ends: 95 [2018-01-28 21:10:59,458 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=612, Invalid=5240, Unknown=0, NotChecked=0, Total=5852 [2018-01-28 21:10:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-01-28 21:10:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-01-28 21:10:59,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-28 21:10:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2018-01-28 21:10:59,463 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 62 [2018-01-28 21:10:59,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:10:59,463 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2018-01-28 21:10:59,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-28 21:10:59,463 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2018-01-28 21:10:59,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-28 21:10:59,463 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:10:59,464 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:10:59,464 INFO L371 AbstractCegarLoop]: === Iteration 27 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:10:59,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1474470770, now seen corresponding path program 2 times [2018-01-28 21:10:59,464 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:10:59,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:10:59,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:59,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:10:59,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:10:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:10:59,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:10:59,765 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 21 DAG size of output 18 [2018-01-28 21:11:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:11:00,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:11:00,226 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:11:00,231 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:11:00,242 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:11:00,249 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:11:00,252 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:11:00,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:11:00,257 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-01-28 21:11:00,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:00,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:00,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:11:00,263 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:00,264 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:00,264 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-01-28 21:11:00,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:00,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-28 21:11:00,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:00,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:00,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 21:11:00,317 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-01-28 21:11:00,319 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-01-28 21:11:00,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:00,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:00,325 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-01-28 21:11:00,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 21:11:00,690 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-01-28 21:11:00,692 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-01-28 21:11:00,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:00,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:00,704 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-01-28 21:11:00,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-28 21:11:00,875 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-01-28 21:11:00,884 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-01-28 21:11:00,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:11:00,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:11:00,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:11:00,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-28 21:11:01,015 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:11:01,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:11:01,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2018-01-28 21:11:01,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-28 21:11:01,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-28 21:11:01,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2018-01-28 21:11:01,050 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand 38 states. [2018-01-28 21:11:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:11:02,930 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2018-01-28 21:11:02,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 21:11:02,930 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 68 [2018-01-28 21:11:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:11:02,931 INFO L225 Difference]: With dead ends: 110 [2018-01-28 21:11:02,931 INFO L226 Difference]: Without dead ends: 109 [2018-01-28 21:11:02,932 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=306, Invalid=3116, Unknown=0, NotChecked=0, Total=3422 [2018-01-28 21:11:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-28 21:11:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-01-28 21:11:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-28 21:11:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2018-01-28 21:11:02,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 68 [2018-01-28 21:11:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:11:02,941 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2018-01-28 21:11:02,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-28 21:11:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2018-01-28 21:11:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-28 21:11:02,942 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:11:02,942 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:11:02,942 INFO L371 AbstractCegarLoop]: === Iteration 28 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:11:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1536046356, now seen corresponding path program 2 times [2018-01-28 21:11:02,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:11:02,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:11:02,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:02,943 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:11:02,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:11:02,959 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:11:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:11:03,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:11:03,378 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:11:03,383 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:11:03,398 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:11:03,406 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:11:03,411 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:11:03,415 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:11:03,419 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-01-28 21:11:03,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:03,423 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-01-28 21:11:03,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:03,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:03,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:11:03,433 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:03,434 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-01-28 21:11:03,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:03,442 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:03,443 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:03,443 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-01-28 21:11:03,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:03,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:03,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:11:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:11:03,806 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:11:03,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 28 [2018-01-28 21:11:03,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-28 21:11:03,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-28 21:11:03,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=741, Unknown=0, NotChecked=0, Total=812 [2018-01-28 21:11:03,807 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 29 states. [2018-01-28 21:11:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:11:04,867 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-01-28 21:11:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-01-28 21:11:04,868 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 69 [2018-01-28 21:11:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:11:04,868 INFO L225 Difference]: With dead ends: 110 [2018-01-28 21:11:04,868 INFO L226 Difference]: Without dead ends: 109 [2018-01-28 21:11:04,869 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=270, Invalid=2082, Unknown=0, NotChecked=0, Total=2352 [2018-01-28 21:11:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-01-28 21:11:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2018-01-28 21:11:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-28 21:11:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2018-01-28 21:11:04,876 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 69 [2018-01-28 21:11:04,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:11:04,877 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2018-01-28 21:11:04,877 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-28 21:11:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2018-01-28 21:11:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-28 21:11:04,878 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:11:04,878 INFO L330 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:11:04,878 INFO L371 AbstractCegarLoop]: === Iteration 29 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:11:04,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1451835661, now seen corresponding path program 2 times [2018-01-28 21:11:04,878 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:11:04,878 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:11:04,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:04,879 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:11:04,879 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:11:04,897 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:11:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:11:05,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:11:05,527 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:11:05,532 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-28 21:11:05,544 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:11:05,551 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-28 21:11:05,554 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:11:05,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:11:05,560 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-01-28 21:11:05,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:05,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:05,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:11:05,567 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:05,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:05,568 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-01-28 21:11:05,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:05,572 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-01-28 21:11:05,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:05,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:05,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 21:11:05,618 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-01-28 21:11:05,620 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-01-28 21:11:05,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:05,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:05,626 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-01-28 21:11:05,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 21:11:05,958 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-01-28 21:11:05,959 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-01-28 21:11:05,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:05,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:05,970 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-01-28 21:11:05,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:37, output treesize:22 [2018-01-28 21:11:06,125 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-01-28 21:11:06,130 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-01-28 21:11:06,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:11:06,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:11:06,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:11:06,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:37 [2018-01-28 21:11:06,214 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:11:06,234 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:11:06,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 37 [2018-01-28 21:11:06,234 INFO L409 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-01-28 21:11:06,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-01-28 21:11:06,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1321, Unknown=0, NotChecked=0, Total=1406 [2018-01-28 21:11:06,235 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 38 states. [2018-01-28 21:11:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:11:07,853 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-01-28 21:11:07,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-28 21:11:07,853 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2018-01-28 21:11:07,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:11:07,854 INFO L225 Difference]: With dead ends: 107 [2018-01-28 21:11:07,854 INFO L226 Difference]: Without dead ends: 98 [2018-01-28 21:11:07,855 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=306, Invalid=3116, Unknown=0, NotChecked=0, Total=3422 [2018-01-28 21:11:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-28 21:11:07,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-01-28 21:11:07,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-28 21:11:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-01-28 21:11:07,863 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 70 [2018-01-28 21:11:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:11:07,863 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-01-28 21:11:07,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-01-28 21:11:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-01-28 21:11:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-28 21:11:07,864 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:11:07,864 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:11:07,864 INFO L371 AbstractCegarLoop]: === Iteration 30 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:11:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1104147357, now seen corresponding path program 1 times [2018-01-28 21:11:07,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:11:07,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:11:07,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:07,865 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:11:07,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:11:07,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:11:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 21:11:08,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:11:08,450 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-28 21:11:08,459 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:11:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:11:08,501 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:11:08,505 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-01-28 21:11:08,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:08,511 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-01-28 21:11:08,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:08,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:08,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:11:08,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:08,529 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-01-28 21:11:08,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:08,540 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:08,541 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:08,542 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-01-28 21:11:08,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:08,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:08,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:11:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:11:09,034 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:11:09,034 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 32 [2018-01-28 21:11:09,035 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-28 21:11:09,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-28 21:11:09,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=973, Unknown=0, NotChecked=0, Total=1056 [2018-01-28 21:11:09,035 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 33 states. [2018-01-28 21:11:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:11:11,609 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-01-28 21:11:11,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-01-28 21:11:11,610 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 81 [2018-01-28 21:11:11,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:11:11,610 INFO L225 Difference]: With dead ends: 116 [2018-01-28 21:11:11,610 INFO L226 Difference]: Without dead ends: 115 [2018-01-28 21:11:11,612 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1264 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=627, Invalid=4923, Unknown=0, NotChecked=0, Total=5550 [2018-01-28 21:11:11,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-01-28 21:11:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2018-01-28 21:11:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-01-28 21:11:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-01-28 21:11:11,618 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 81 [2018-01-28 21:11:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:11:11,619 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-01-28 21:11:11,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-28 21:11:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-01-28 21:11:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-28 21:11:11,620 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:11:11,620 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:11:11,620 INFO L371 AbstractCegarLoop]: === Iteration 31 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:11:11,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1345617343, now seen corresponding path program 3 times [2018-01-28 21:11:11,620 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:11:11,620 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:11:11,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:11,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:11:11,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:11:11,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:11:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 21:11:12,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:11:12,213 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:11:12,220 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:11:12,234 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:12,240 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:12,246 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:12,251 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:12,254 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:11:12,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:11:12,260 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-01-28 21:11:12,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-28 21:11:12,279 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:12,280 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:12,280 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-01-28 21:11:12,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-01-28 21:11:12,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-01-28 21:11:12,330 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-01-28 21:11:12,332 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-01-28 21:11:12,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,352 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-01-28 21:11:12,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-01-28 21:11:12,475 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-01-28 21:11:12,477 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-01-28 21:11:12,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-01-28 21:11:12,501 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-01-28 21:11:12,502 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-01-28 21:11:12,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:12,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-01-28 21:11:12,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-01-28 21:11:12,560 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-01-28 21:11:12,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:11:12,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:11:12,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:11:12,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-01-28 21:11:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 21:11:12,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:11:12,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 31 [2018-01-28 21:11:12,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-01-28 21:11:12,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-01-28 21:11:12,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2018-01-28 21:11:12,663 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 32 states. [2018-01-28 21:11:13,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:11:13,563 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2018-01-28 21:11:13,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-28 21:11:13,563 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 83 [2018-01-28 21:11:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:11:13,564 INFO L225 Difference]: With dead ends: 97 [2018-01-28 21:11:13,564 INFO L226 Difference]: Without dead ends: 96 [2018-01-28 21:11:13,565 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 71 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=469, Invalid=2501, Unknown=0, NotChecked=0, Total=2970 [2018-01-28 21:11:13,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-01-28 21:11:13,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-01-28 21:11:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-28 21:11:13,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-01-28 21:11:13,569 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 83 [2018-01-28 21:11:13,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:11:13,569 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-01-28 21:11:13,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-01-28 21:11:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-01-28 21:11:13,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-01-28 21:11:13,570 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:11:13,570 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:11:13,570 INFO L371 AbstractCegarLoop]: === Iteration 32 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:11:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1235535297, now seen corresponding path program 3 times [2018-01-28 21:11:13,570 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:11:13,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:11:13,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:13,571 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:11:13,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:11:13,583 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:11:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-28 21:11:14,088 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:11:14,088 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:11:14,095 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:11:14,110 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:14,116 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:14,122 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:14,130 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:14,134 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:11:14,138 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:11:14,142 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-01-28 21:11:14,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:14,148 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-01-28 21:11:14,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:14,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:14,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-28 21:11:14,206 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:14,208 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-01-28 21:11:14,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:14,216 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:14,217 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:14,218 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-01-28 21:11:14,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:14,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:14,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-01-28 21:11:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:11:15,160 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:11:15,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 49 [2018-01-28 21:11:15,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-01-28 21:11:15,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-01-28 21:11:15,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2314, Unknown=0, NotChecked=0, Total=2450 [2018-01-28 21:11:15,162 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 50 states. [2018-01-28 21:11:19,369 WARN L146 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 75 DAG size of output 61 [2018-01-28 21:11:19,567 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 68 DAG size of output 58 [2018-01-28 21:11:19,774 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 65 DAG size of output 55 [2018-01-28 21:11:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:11:20,536 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-01-28 21:11:20,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-01-28 21:11:20,536 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 84 [2018-01-28 21:11:20,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:11:20,537 INFO L225 Difference]: With dead ends: 120 [2018-01-28 21:11:20,537 INFO L226 Difference]: Without dead ends: 119 [2018-01-28 21:11:20,539 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2481 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1137, Invalid=9369, Unknown=0, NotChecked=0, Total=10506 [2018-01-28 21:11:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-28 21:11:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2018-01-28 21:11:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-28 21:11:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-01-28 21:11:20,547 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 84 [2018-01-28 21:11:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:11:20,547 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-01-28 21:11:20,548 INFO L433 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-01-28 21:11:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-01-28 21:11:20,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-28 21:11:20,548 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:11:20,548 INFO L330 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:11:20,549 INFO L371 AbstractCegarLoop]: === Iteration 33 === [cstrlcpyErr6RequiresViolation, cstrlcpyErr4RequiresViolation, cstrlcpyErr5RequiresViolation, cstrlcpyErr7RequiresViolation, cstrlcpyErr0RequiresViolation, cstrlcpyErr3RequiresViolation, cstrlcpyErr1RequiresViolation, cstrlcpyErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-28 21:11:20,549 INFO L82 PathProgramCache]: Analyzing trace with hash 725927424, now seen corresponding path program 3 times [2018-01-28 21:11:20,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:11:20,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:11:20,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:20,550 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-28 21:11:20,550 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:11:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:11:20,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:11:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-28 21:11:21,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-28 21:11:21,223 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-28 21:11:21,230 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-28 21:11:21,244 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:21,250 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:21,260 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:21,267 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-28 21:11:21,270 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-28 21:11:21,274 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-28 21:11:21,276 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-01-28 21:11:21,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-28 21:11:21,316 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-01-28 21:11:21,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,322 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:21,323 INFO L700 Elim1Store]: detected not equals via solver [2018-01-28 21:11:21,323 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-01-28 21:11:21,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-01-28 21:11:21,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-28 21:11:21,373 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-01-28 21:11:21,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-01-28 21:11:21,653 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-01-28 21:11:21,654 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-01-28 21:11:21,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-01-28 21:11:21,825 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-01-28 21:11:21,828 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-01-28 21:11:21,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-28 21:11:21,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-01-28 21:11:21,992 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 19 treesize of output 15 [2018-01-28 21:11:21,997 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 15 treesize of output 12 [2018-01-28 21:11:21,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-28 21:11:21,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:11:22,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-28 21:11:22,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-01-28 21:11:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-28 21:11:22,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-28 21:11:22,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 28] total 50 [2018-01-28 21:11:22,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-01-28 21:11:22,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-01-28 21:11:22,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2366, Unknown=0, NotChecked=0, Total=2550 [2018-01-28 21:11:22,139 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 51 states. [2018-01-28 21:11:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:11:24,003 INFO L93 Difference]: Finished difference Result 116 states and 119 transitions. [2018-01-28 21:11:24,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-28 21:11:24,004 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 85 [2018-01-28 21:11:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:11:24,004 INFO L225 Difference]: With dead ends: 116 [2018-01-28 21:11:24,004 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:11:24,005 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2310 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=869, Invalid=8061, Unknown=0, NotChecked=0, Total=8930 [2018-01-28 21:11:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:11:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:11:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:11:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:11:24,006 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2018-01-28 21:11:24,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:11:24,006 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:11:24,006 INFO L433 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-01-28 21:11:24,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:11:24,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:11:24,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:11:24,200 WARN L146 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 288 DAG size of output 265 [2018-01-28 21:11:24,516 WARN L146 SmtUtils]: Spent 314ms on a formula simplification. DAG size of input: 85 DAG size of output 64 [2018-01-28 21:11:24,644 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 121 DAG size of output 59 [2018-01-28 21:11:25,480 WARN L146 SmtUtils]: Spent 833ms on a formula simplification. DAG size of input: 306 DAG size of output 151 [2018-01-28 21:11:25,484 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr2RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,484 INFO L395 ceAbstractionStarter]: At program point cstrlcpyENTRY(lines 540 559) the Hoare annotation is: (let ((.cse0 (select |#length| |cstrlcpy_#in~dst.base|))) (or (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|) (not (= 1 (select |#valid| |cstrlcpy_#in~src.base|))) (exists ((main_~nondetString2~6.offset Int)) (and (= 0 (select (select |#memory_int| |cstrlcpy_#in~src.base|) (+ main_~nondetString2~6.offset (select |#length| |cstrlcpy_#in~src.base|) (- 1)))) (<= main_~nondetString2~6.offset 0) (<= 0 main_~nondetString2~6.offset))) (< 2147483647 |cstrlcpy_#in~siz|) (not (= |cstrlcpy_#in~dst.offset| 0)) (not (= (select |#valid| |cstrlcpy_#in~dst.base|) 1)) (not (= .cse0 |cstrlcpy_#in~siz|)) (not (= (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))) 0)) (not (= 0 |cstrlcpy_#in~src.offset|)) (not (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_2 Int) (main_~length~6 Int)) (and (= 0 (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6 (- 1)))) (<= 1 main_~length~6) (<= |cstrlcpy_#in~src.offset| v_main_~nondetString2~6.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6) (select |#length| |cstrlcpy_#in~src.base|))))) (< .cse0 1))) [2018-01-28 21:11:25,484 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 559) no Hoare annotation was computed. [2018-01-28 21:11:25,484 INFO L399 ceAbstractionStarter]: For program point L546(lines 546 551) no Hoare annotation was computed. [2018-01-28 21:11:25,484 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-28 21:11:25,484 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-28 21:11:25,484 INFO L399 ceAbstractionStarter]: For program point L548''''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L555'''(line 555) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr3RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L548''''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point cstrlcpyFINAL(lines 540 559) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L546'(lines 546 551) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr4RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L548'''''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L548'''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr0RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L555'''''''(line 555) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr5RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,485 INFO L399 ceAbstractionStarter]: For program point L548''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,486 INFO L399 ceAbstractionStarter]: For program point L555'''''''''(lines 555 556) no Hoare annotation was computed. [2018-01-28 21:11:25,486 INFO L399 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-28 21:11:25,486 INFO L399 ceAbstractionStarter]: For program point L548'''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,486 INFO L399 ceAbstractionStarter]: For program point L547'(line 547) no Hoare annotation was computed. [2018-01-28 21:11:25,486 INFO L395 ceAbstractionStarter]: At program point L547''''''(lines 547 550) the Hoare annotation is: (let ((.cse8 (select |#length| cstrlcpy_~dst.base))) (let ((.cse0 (not (= cstrlcpy_~d~2.base cstrlcpy_~s~2.base))) (.cse4 (not (= cstrlcpy_~src.base cstrlcpy_~dst.base))) (.cse6 (select |#length| cstrlcpy_~d~2.base)) (.cse5 (= 1 (select |#valid| cstrlcpy_~src.base))) (.cse7 (<= .cse8 cstrlcpy_~siz)) (.cse9 (= 1 (select |#valid| cstrlcpy_~dst.base))) (.cse11 (= 1 (select |#valid| cstrlcpy_~s~2.base))) (.cse1 (<= cstrlcpy_~siz .cse8)) (.cse2 (= 0 cstrlcpy_~dst.offset)) (.cse12 (= 1 (select |#valid| cstrlcpy_~d~2.base))) (.cse3 (= 0 cstrlcpy_~src.offset)) (.cse10 (+ (select |#length| |cstrlcpy_#in~src.base|) (- 1))) (.cse16 (select |#length| |cstrlcpy_#in~dst.base|))) (or (= |cstrlcpy_#in~dst.base| |cstrlcpy_#in~src.base|) (not (= 1 (select |#valid| |cstrlcpy_#in~src.base|))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_2 Int) (main_~length~6 Int)) (and (<= 1 main_~length~6) (= 0 (select (select |#memory_int| cstrlcpy_~s~2.base) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6 (- 1)))) (<= cstrlcpy_~s~2.offset v_main_~nondetString2~6.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6) (select |#length| cstrlcpy_~s~2.base)))) (not (= cstrlcpy_~d~2.base cstrlcpy_~src.base)) (= .cse6 cstrlcpy_~n~2) .cse7 (<= .cse8 |cstrlcpy_#in~siz|) (= .cse6 cstrlcpy_~siz) (not (= cstrlcpy_~dst.base |cstrlcpy_#in~src.base|)) (= cstrlcpy_~s~2.offset 0) .cse9 (exists ((main_~nondetString2~6.offset Int)) (and (<= main_~nondetString2~6.offset 0) (= (select (select |#memory_int| cstrlcpy_~src.base) (+ main_~nondetString2~6.offset (select |#length| cstrlcpy_~src.base) (- 1))) 0) (<= 0 main_~nondetString2~6.offset))) (= (select (select |#memory_int| |cstrlcpy_#in~src.base|) .cse10) 0) .cse11 (= 0 cstrlcpy_~d~2.offset) (<= |cstrlcpy_#in~siz| .cse8) (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_3 Int) (main_~length~6 Int)) (and (<= cstrlcpy_~src.offset v_main_~nondetString2~6.offset_BEFORE_CALL_3) (<= 1 main_~length~6) (= (select (select |#memory_int| cstrlcpy_~src.base) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_3 main_~length~6 (- 1))) 0) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_3 main_~length~6) (select |#length| cstrlcpy_~src.base)))) .cse12 (exists ((main_~nondetString2~6.offset Int)) (and (= (select (select |#memory_int| cstrlcpy_~s~2.base) (+ (select |#length| cstrlcpy_~s~2.base) main_~nondetString2~6.offset (- 1))) 0) (<= main_~nondetString2~6.offset 0) (<= 0 main_~nondetString2~6.offset)))) (not (= |cstrlcpy_#in~dst.offset| 0)) (let ((.cse13 (+ cstrlcpy_~n~2 cstrlcpy_~d~2.offset)) (.cse14 (select |#length| cstrlcpy_~s~2.base)) (.cse15 (select |#length| cstrlcpy_~src.base))) (and (not (= |cstrlcpy_#in~src.base| cstrlcpy_~dst.base)) (<= .cse6 .cse13) (<= .cse13 .cse6) .cse0 (and .cse4 (<= (+ cstrlcpy_~d~2.offset 1) .cse6) (= 0 (select (select |#memory_int| cstrlcpy_~s~2.base) (+ .cse14 (- 1)))) .cse5 (<= 1 cstrlcpy_~d~2.offset) .cse7 (<= 1 .cse15) .cse9 (<= 1 cstrlcpy_~s~2.offset) .cse11 .cse1 (not (= cstrlcpy_~src.base cstrlcpy_~d~2.base)) .cse2 (not (= (mod cstrlcpy_~n~2 4294967296) 0)) .cse12 .cse3) (<= (+ cstrlcpy_~s~2.offset 1) .cse14) (= .cse8 |cstrlcpy_#in~siz|) (= 0 (select (select |#memory_int| cstrlcpy_~src.base) (+ .cse15 (- 1)))))) (not (= (select |#valid| |cstrlcpy_#in~dst.base|) 1)) (not (= 0 |cstrlcpy_#in~src.offset|)) (< 2147483647 |cstrlcpy_#in~siz|) (not (= .cse16 |cstrlcpy_#in~siz|)) (not (= (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) .cse10) 0)) (not (exists ((v_main_~nondetString2~6.offset_BEFORE_CALL_2 Int) (main_~length~6 Int)) (and (= 0 (select (select |old(#memory_int)| |cstrlcpy_#in~src.base|) (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6 (- 1)))) (<= 1 main_~length~6) (<= |cstrlcpy_#in~src.offset| v_main_~nondetString2~6.offset_BEFORE_CALL_2) (<= (+ v_main_~nondetString2~6.offset_BEFORE_CALL_2 main_~length~6) (select |#length| |cstrlcpy_#in~src.base|))))) (< .cse16 1)))) [2018-01-28 21:11:25,486 INFO L399 ceAbstractionStarter]: For program point L547''(lines 547 550) no Hoare annotation was computed. [2018-01-28 21:11:25,486 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr7RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,486 INFO L399 ceAbstractionStarter]: For program point L555''''''''(line 555) no Hoare annotation was computed. [2018-01-28 21:11:25,486 INFO L399 ceAbstractionStarter]: For program point L548''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L548'''''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L548'''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L553(lines 553 554) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 559) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L552(lines 552 557) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L555(lines 555 556) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point cstrlcpyEXIT(lines 540 559) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr1RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L548''''''''''''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L555''''(line 555) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point L555'''''(line 555) no Hoare annotation was computed. [2018-01-28 21:11:25,487 INFO L399 ceAbstractionStarter]: For program point cstrlcpyErr6RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point L547'''''(line 547) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 575) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 575) the Hoare annotation is: true [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 575) the Hoare annotation is: true [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point L571'(line 571) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-28 21:11:25,488 INFO L399 ceAbstractionStarter]: For program point L564(line 564) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L563(lines 563 565) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L567(line 567) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L570''(line 570) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L566'(lines 566 568) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L570(line 570) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L570'(line 570) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L570'''(line 570) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 575) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L562'(line 562) no Hoare annotation was computed. [2018-01-28 21:11:25,489 INFO L399 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2018-01-28 21:11:25,490 INFO L399 ceAbstractionStarter]: For program point L573(line 573) no Hoare annotation was computed. [2018-01-28 21:11:25,490 INFO L395 ceAbstractionStarter]: At program point L572(line 572) the Hoare annotation is: (let ((.cse0 (select |#length| main_~nondetString2~6.base))) (and (= 1 (select |#valid| |main_#t~malloc10.base|)) (= 0 |main_#t~malloc11.offset|) (<= 1 main_~n~6) (= (select |#valid| main_~nondetString1~6.base) 1) (= main_~length~6 .cse0) (not (= |main_#t~malloc11.base| main_~nondetString1~6.base)) (exists ((main_~length~6 Int)) (and (= 0 (select (select |#memory_int| main_~nondetString2~6.base) (+ main_~nondetString2~6.offset main_~length~6 (- 1)))) (<= 1 main_~length~6) (<= (+ main_~nondetString2~6.offset main_~length~6) (select |#length| main_~nondetString2~6.base)))) (= (store (store |#valid| |main_#t~malloc10.base| (select (store |#valid| |main_#t~malloc10.base| 0) |main_#t~malloc10.base|)) |main_#t~malloc11.base| 0) |old(#valid)|) (= 0 main_~nondetString2~6.offset) (<= main_~n~6 2147483647) (= (select (select |#memory_int| main_~nondetString2~6.base) (+ main_~nondetString2~6.offset .cse0 (- 1))) 0) (= main_~n~6 (select |#length| main_~nondetString1~6.base)) (not (= main_~nondetString2~6.base main_~nondetString1~6.base)) (= 1 (select |#valid| main_~nondetString2~6.base)) (= main_~length~6 (select |#length| |main_#t~malloc11.base|)) (= main_~n~6 (select |#length| |main_#t~malloc10.base|)) (= main_~nondetString1~6.offset 0) (not (= |main_#t~malloc10.base| |main_#t~malloc11.base|)) (= 1 (select |#valid| |main_#t~malloc11.base|)) (= |main_#t~malloc10.offset| 0))) [2018-01-28 21:11:25,490 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 560 575) no Hoare annotation was computed. [2018-01-28 21:11:25,490 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 560 575) no Hoare annotation was computed. [2018-01-28 21:11:25,490 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 560 575) no Hoare annotation was computed. [2018-01-28 21:11:25,490 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 560 575) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:11:25,490 INFO L399 ceAbstractionStarter]: For program point L562''(line 562) no Hoare annotation was computed. [2018-01-28 21:11:25,490 INFO L399 ceAbstractionStarter]: For program point L563''(lines 563 565) no Hoare annotation was computed. [2018-01-28 21:11:25,490 INFO L399 ceAbstractionStarter]: For program point L569''(line 569) no Hoare annotation was computed. [2018-01-28 21:11:25,490 INFO L399 ceAbstractionStarter]: For program point L569'(line 569) no Hoare annotation was computed. [2018-01-28 21:11:25,501 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,502 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,503 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,503 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,503 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,504 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,504 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,505 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,505 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,505 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,506 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,506 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,506 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,506 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,507 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,509 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,510 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,510 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,510 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,512 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,513 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,514 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,515 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,516 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,516 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,516 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,516 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,516 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,516 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,517 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,518 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,527 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,528 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,529 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,530 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,531 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,532 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,533 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,533 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,534 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,535 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,536 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,537 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,538 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,539 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:11:25 BoogieIcfgContainer [2018-01-28 21:11:25,542 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:11:25,543 INFO L168 Benchmark]: Toolchain (without parser) took 50771.60 ms. Allocated memory was 304.6 MB in the beginning and 789.1 MB in the end (delta: 484.4 MB). Free memory was 264.6 MB in the beginning and 610.3 MB in the end (delta: -345.6 MB). Peak memory consumption was 455.7 MB. Max. memory is 5.3 GB. [2018-01-28 21:11:25,544 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:11:25,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.00 ms. Allocated memory is still 304.6 MB. Free memory was 263.6 MB in the beginning and 253.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:11:25,544 INFO L168 Benchmark]: Boogie Preprocessor took 37.33 ms. Allocated memory is still 304.6 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:11:25,544 INFO L168 Benchmark]: RCFGBuilder took 338.22 ms. Allocated memory is still 304.6 MB. Free memory was 251.7 MB in the beginning and 229.0 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-01-28 21:11:25,545 INFO L168 Benchmark]: TraceAbstraction took 50165.59 ms. Allocated memory was 304.6 MB in the beginning and 789.1 MB in the end (delta: 484.4 MB). Free memory was 229.0 MB in the beginning and 610.3 MB in the end (delta: -381.3 MB). Peak memory consumption was 420.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:11:25,546 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.26 ms. Allocated memory is still 304.6 MB. Free memory is still 270.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.00 ms. Allocated memory is still 304.6 MB. Free memory was 263.6 MB in the beginning and 253.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.33 ms. Allocated memory is still 304.6 MB. Free memory was 253.7 MB in the beginning and 251.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 338.22 ms. Allocated memory is still 304.6 MB. Free memory was 251.7 MB in the beginning and 229.0 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50165.59 ms. Allocated memory was 304.6 MB in the beginning and 789.1 MB in the end (delta: 484.4 MB). Free memory was 229.0 MB in the beginning and 610.3 MB in the end (delta: -381.3 MB). Peak memory consumption was 420.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 - InvariantResult [Line: 547]: Loop Invariant [2018-01-28 21:11:25,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,556 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,557 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,557 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,557 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,558 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,558 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,559 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,559 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,559 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,559 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,560 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,561 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,562 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,563 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,563 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,564 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,565 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,566 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,567 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,568 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,569 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,572 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,573 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,574 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,575 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,576 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_3,QUANTIFIED] [2018-01-28 21:11:25,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,577 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~nondetString2~6.offset,QUANTIFIED] [2018-01-28 21:11:25,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,578 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~nondetString2~6.offset_BEFORE_CALL_2,QUANTIFIED] [2018-01-28 21:11:25,579 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~length~6,QUANTIFIED] [2018-01-28 21:11:25,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,579 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,580 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,581 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,582 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,583 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,584 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,585 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,586 WARN L1215 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-01-28 21:11:25,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-28 21:11:25,587 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((dst == src || !(1 == \valid[src])) || ((((((((((((((((((((((!(d == s) && siz <= unknown-#length-unknown[dst]) && 0 == dst) && 0 == src) && !(src == dst)) && 1 == \valid[src]) && (\exists v_main_~nondetString2~6.offset_BEFORE_CALL_2 : int, main_~length~6 : int :: ((1 <= main_~length~6 && 0 == unknown-#memory_int-unknown[s][v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 + -1]) && s <= v_main_~nondetString2~6.offset_BEFORE_CALL_2) && v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 <= unknown-#length-unknown[s])) && !(d == src)) && unknown-#length-unknown[d] == n) && unknown-#length-unknown[dst] <= siz) && unknown-#length-unknown[dst] <= \old(siz)) && unknown-#length-unknown[d] == siz) && !(dst == src)) && s == 0) && 1 == \valid[dst]) && (\exists main_~nondetString2~6.offset : int :: (main_~nondetString2~6.offset <= 0 && unknown-#memory_int-unknown[src][main_~nondetString2~6.offset + unknown-#length-unknown[src] + -1] == 0) && 0 <= main_~nondetString2~6.offset)) && unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1] == 0) && 1 == \valid[s]) && 0 == d) && \old(siz) <= unknown-#length-unknown[dst]) && (\exists v_main_~nondetString2~6.offset_BEFORE_CALL_3 : int, main_~length~6 : int :: ((src <= v_main_~nondetString2~6.offset_BEFORE_CALL_3 && 1 <= main_~length~6) && unknown-#memory_int-unknown[src][v_main_~nondetString2~6.offset_BEFORE_CALL_3 + main_~length~6 + -1] == 0) && v_main_~nondetString2~6.offset_BEFORE_CALL_3 + main_~length~6 <= unknown-#length-unknown[src])) && 1 == \valid[d]) && (\exists main_~nondetString2~6.offset : int :: (unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + main_~nondetString2~6.offset + -1] == 0 && main_~nondetString2~6.offset <= 0) && 0 <= main_~nondetString2~6.offset))) || !(dst == 0)) || (((((((!(src == dst) && unknown-#length-unknown[d] <= n + d) && n + d <= unknown-#length-unknown[d]) && !(d == s)) && ((((((((((((((!(src == dst) && d + 1 <= unknown-#length-unknown[d]) && 0 == unknown-#memory_int-unknown[s][unknown-#length-unknown[s] + -1]) && 1 == \valid[src]) && 1 <= d) && unknown-#length-unknown[dst] <= siz) && 1 <= unknown-#length-unknown[src]) && 1 == \valid[dst]) && 1 <= s) && 1 == \valid[s]) && siz <= unknown-#length-unknown[dst]) && !(src == d)) && 0 == dst) && !(n % 4294967296 == 0)) && 1 == \valid[d]) && 0 == src) && s + 1 <= unknown-#length-unknown[s]) && unknown-#length-unknown[dst] == \old(siz)) && 0 == unknown-#memory_int-unknown[src][unknown-#length-unknown[src] + -1])) || !(\valid[dst] == 1)) || !(0 == src)) || 2147483647 < \old(siz)) || !(unknown-#length-unknown[dst] == \old(siz))) || !(\old(unknown-#memory_int-unknown)[src][unknown-#length-unknown[src] + -1] == 0)) || !(\exists v_main_~nondetString2~6.offset_BEFORE_CALL_2 : int, main_~length~6 : int :: ((0 == \old(unknown-#memory_int-unknown)[src][v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 + -1] && 1 <= main_~length~6) && src <= v_main_~nondetString2~6.offset_BEFORE_CALL_2) && v_main_~nondetString2~6.offset_BEFORE_CALL_2 + main_~length~6 <= unknown-#length-unknown[src])) || unknown-#length-unknown[dst] < 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 87 locations, 13 error locations. SAFE Result, 50.0s OverallTime, 33 OverallIterations, 4 TraceHistogramMax, 29.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2089 SDtfs, 7182 SDslu, 18870 SDs, 0 SdLazy, 12691 SolverSat, 781 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1778 GetRequests, 743 SyntacticMatches, 35 SemanticMatches, 1000 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10791 ImplicationChecksByTransitivity, 34.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=18, 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.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 224 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 11 NumberOfFragments, 609 HoareAnnotationTreeSize, 7 FomulaSimplifications, 698 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 2881 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.0s InterpolantComputationTime, 2526 NumberOfCodeBlocks, 2526 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2479 ConstructedInterpolants, 180 QuantifiedInterpolants, 1879843 SizeOfPredicates, 328 NumberOfNonLiveVariables, 2775 ConjunctsInSsa, 742 ConjunctsInUnsatCore, 47 InterpolantComputations, 20 PerfectInterpolantSequences, 61/860 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-11-25-593.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-11-25-593.csv Received shutdown request...